#queue

class queue:

    p=-1
    s=[]

    def enque(self,a):

        self.s.append(a)

    def deque(self):

        self.p=self.p+1
        print(self.s[self.p])
        
    def isempty(self):
        if(self.p == (len(self.s)-1)):
            print("queue is empty")
        else:
            print("queue is not empty")
    def einque(self):

        print("elements left in a queue are: ",end="")
        print(self.s[self.p+1:])

if __name__=='__main__':

    q=queue()

    q.enque(1)
    q.enque(2)
    q.enque(3)
    q.deque()
    q.isempty()
    q.einque()


        

80feff0507c8efb98671a5762b876303720a63c9
class queue:
    <mask token>
    <mask token>
    <mask token>

    def deque(self):
        self.p = self.p + 1
        print(self.s[self.p])
    <mask token>

    def einque(self):
        print('elements left in a queue are: ', end='')
        print(self.s[self.p + 1:])


<mask token>

class queue:
    <mask token>
    <mask token>

    def enque(self, a):
        self.s.append(a)

    def deque(self):
        self.p = self.p + 1
        print(self.s[self.p])

    def isempty(self):
        if self.p == len(self.s) - 1:
            print('queue is empty')
        else:
            print('queue is not empty')

    def einque(self):
        print('elements left in a queue are: ', end='')
        print(self.s[self.p + 1:])


<mask token>

class queue:
    p = -1
    s = []

    def enque(self, a):
        self.s.append(a)

    def deque(self):
        self.p = self.p + 1
        print(self.s[self.p])

    def isempty(self):
        if self.p == len(self.s) - 1:
            print('queue is empty')
        else:
            print('queue is not empty')

    def einque(self):
        print('elements left in a queue are: ', end='')
        print(self.s[self.p + 1:])


<mask token>

class queue:
    p = -1
    s = []

    def enque(self, a):
        self.s.append(a)

    def deque(self):
        self.p = self.p + 1
        print(self.s[self.p])

    def isempty(self):
        if self.p == len(self.s) - 1:
            print('queue is empty')
        else:
            print('queue is not empty')

    def einque(self):
        print('elements left in a queue are: ', end='')
        print(self.s[self.p + 1:])


if __name__ == '__main__':
    q = queue()
    q.enque(1)
    q.enque(2)
    q.enque(3)
    q.deque()
    q.isempty()
    q.einque()

#queue

class queue:

    p=-1
    s=[]

    def enque(self,a):

        self.s.append(a)

    def deque(self):

        self.p=self.p+1
        print(self.s[self.p])
        
    def isempty(self):
        if(self.p == (len(self.s)-1)):
            print("queue is empty")
        else:
            print("queue is not empty")
    def einque(self):

        print("elements left in a queue are: ",end="")
        print(self.s[self.p+1:])

if __name__=='__main__':

    q=queue()

    q.enque(1)
    q.enque(2)
    q.enque(3)
    q.deque()
    q.isempty()
    q.einque()


        
