#include<iostream>

#include<stdlib.h>
#include<stdio.h>

using namespace std;

struct queue
{

    int val;
    queue * next;

    queue * head;
    queue * top;
    void enqueue()
    {
        queue * new_ele=new queue;

        if(head==nullptr)
        {
            top=new_ele;
            head=new_ele;

        }
        else
        {
            head->next=new_ele;
            head=new_ele;
        }

        std::cout<<"n Enter value of element: ";
        std::cin>>new_ele->val;
        std::cout<<" Element "<<new_ele->val<<" pushed into stack";

    }

    void dequeue()
    {
        if(top==nullptr)
        {
            std::cout<<"n Stack is empty ";
        }
        else
        {
            std::cout<<" n Element "<<top->val<<" is popped";
            auto popped_ele=top;
            top=top->next;
            free(popped_ele);
        }
        

    }
};

int main()
{

queue q;
int n;
std::cout<<"n Enter number of elements:";
std::cin>>n;

int i=0;
while(i++<n)
{

    q.enqueue();

}

i=n;

while((i--)>0)
{

    q.dequeue();
}

}