Implement queue with Python list

# Completed implementation of a queue ADT
class Queue:
    def __init__(self):
        self.data = []

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

    def enqueue(self, item):
        self.data.insert(0, item)

    def dequeue(self):
        return self.data.pop()

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

if __name__ == '__main__':
    q = Queue()
    q.enqueue('Hello')
    q.enqueue('dog')
    q.enqueue(3)
    print(q.size())
    while not q.is_empty():
        print(q.dequeue(), end=', ')
    print()

A simple case to use Queue:

from queue import Queue

def hot_potato(name_list, num):
    '''A.K.A. Josephus problem.'''
    sim_queue = Queue()
    for name in name_list:
        sim_queue.enqueue(name)

    while sim_queue.size() > 1:
        for i in range(num):
            sim_queue.enqueue(sim_queue.dequeue())
        sim_queue.dequeue()
    return sim_queue.dequeue()

if __name__ == '__main__':
    print(hot_potato(["Bill", "David", "Susan", "Jane", "Kent", "Brad"], 7))

Susan