class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class LinkedList:
    def __init__(self):
        self.head = None
        self.tail = None   # Important as per question

    def insert_at_tail(self, data):
        new_node = Node(data)
        if self.head is None:
            self.head = new_node
            self.tail = new_node
        else:
            self.tail.next = new_node
            self.tail = new_node

    def display(self):
        current = self.head
        result = []
        while current:
            result.append(current.data)
            current = current.next
        return " ".join(result)

def is_valid_name(name):
    return name.isalpha()

# Main program
n = int(input().strip())
ll = LinkedList()

valid = True
for _ in range(n):
    name = input().strip()
    if not is_valid_name(name):
        valid = False
    ll.insert_at_tail(name)

if valid:
    print(ll.display())
else:
    print("Invalid input")