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

class VisitorList:
    def __init__(self):
        self.head = None
        self.tail = None  # Use tail for efficient insertion at the end

    def add_visitor(self, name):
        # Validate name: only allow alphabets
        if not name.isalpha():
            return False
        new_node = Node(name)
        if self.head is None:
            self.head = self.tail = new_node
        else:
            self.tail.next = new_node
            self.tail = new_node
        return True

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

# Read input
n = int(input())
visitor_list = VisitorList()
valid_input = True

for _ in range(n):
    name = input().strip()
    if not visitor_list.add_visitor(name):
        valid_input = False
        break

if valid_input:
    visitor_list.print_visitors()
else:
    print("Invalid input")