import re

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

class VisitorLinkedList:
    def __init__(self):
        self.head = None
        self.tail = None  # Maintains reference to the tail

    def add_to_tail(self, name):
        new_node = Node(name)
        if not self.head:
            self.head = new_node
        else:
            self.tail.next = new_node
        self.tail = new_node  # Update tail

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

# Input reading and processing
n = int(input())
visitor_list = VisitorLinkedList()
invalid = False

for _ in range(n):
    name = input()
    if not re.match(r"^[A-Za-z ]+$", name):
        invalid = True
        break
    visitor_list.add_to_tail(name)

if invalid:
    print("Invalid input")
else:
    visitor_list.display()