Queue using Collections in DSA Python

Program 1

# Queue implementation using collections
from collections import deque
class MyQueue:
    def __init__(self):
        self.queue=deque()

    def qinsert(self):
        n=int(input("Enter an element for insert"))
        self.queue.append(n)

    def qdelete(self):        
        if(len(self.queue)==0):
            print("Queue is empty")
        else:
           print("Deleted element is: ",self.queue.popleft())     

    def qdisplay(self):
         if(len(self.queue)==0):
            print("Queue is empty")
         else:
             print("Elements of queue: ")
             for element in self.queue:
                 print(element,end="   ")


# Main 
MQ=MyQueue()
while(1):
    print("\n-----------------------Queue Menu------------------------")
    print("1. Insert \n 2. Delete \n 3. Display \n 4. Exit")
    print("-------------------------------------------------------------")
    choice=int(input("Enter your choice: "))
    if(choice==1):
        MQ.qinsert()
    elif(choice==2):
        MQ.qdelete()        
    elif(choice==3):
        MQ.qdisplay()
    else:
        break