Write a program to simulate a queue of English names. There are three operations:
1. "Push [name]", which means to enque the name into the queue.
2. "Pop", which means to deque. If the queue is empty, this operation takes no effect.
3. "Front", which means to print the name that is at the front of the queue. If the queue is empty, print "empty" (without quotes).
Each line contains one of the following operations: Push [name], Pop, Front. The length of each name is at most 10.
For each "Front" operation, print out the name that is at the front of the queue. Note that you have to add '\n' at the end of each line.