function queue:
head = new node
last = NULL
choice = input()
if choice == "enq", then:
num = input()
enqueue(num)
else if choice == "deq", then:
dequeue()
else:
quit()
function enqueue(n):
p = new node
p.value = n
p.next = NULL
if last != NULL, then:
last.next = p;
else:
head.next = p;
last = p
function dequeue:
print head.next.value
head.next = head.next.next
if head.next = NULL, then:
last = NULL
ZnVuY3Rpb24gcXVldWU6CgloZWFkID0gbmV3IG5vZGUKCWxhc3QgPSBOVUxMCgljaG9pY2UgPSBpbnB1dCgpCglpZiBjaG9pY2UgPT0gImVucSIsIHRoZW46CgkJbnVtID0gaW5wdXQoKQoJCWVucXVldWUobnVtKQoJZWxzZSBpZiBjaG9pY2UgPT0gImRlcSIsIHRoZW46CgkJZGVxdWV1ZSgpCgllbHNlOgoJCXF1aXQoKQoKZnVuY3Rpb24gZW5xdWV1ZShuKToKCXAgPSBuZXcgbm9kZQoJcC52YWx1ZSA9IG4KCXAubmV4dCA9IE5VTEwKCWlmIGxhc3QgIT0gTlVMTCwgdGhlbjoKCQlsYXN0Lm5leHQgPSBwOwoJZWxzZToKCQloZWFkLm5leHQgPSBwOwoJbGFzdCA9IHAKCQpmdW5jdGlvbiBkZXF1ZXVlOgoJcHJpbnQgaGVhZC5uZXh0LnZhbHVlCgloZWFkLm5leHQgPSBoZWFkLm5leHQubmV4dAoJaWYgaGVhZC5uZXh0ID0gTlVMTCwgdGhlbjoKCQlsYXN0ID0gTlVMTA==