class Stack:
    def __init__(self):
        self.items = []

    def is_empty(self):
        return self.items == []

    def push(self, item):
        self.items.append(item)

    def pop(self):
        return self.items.pop()

    def peak(self):
        last = len(self.items) - 1
        return self.items[last]

    def size(self):
        return len(self.items)

stack = Stack()
for i in range(1,6):
    stack.push(i)

reverse_list = []

while stack.size():
    reverse_list.append(stack.pop())

print(reverse_list)
