// CS301P Lab 3 Problem KST Learning

#include<iostream>
#include<conio.h>
using namespace std;

class Node
{
	private:
		int data;
		Node *nextAdd;
	public:
		void setData(int d)
		{
			data = d;	
		}		
		void setNext(Node *ptr)
		{
			nextAdd = ptr;
		}
		int getData()
		{
			return data;
		}
		Node* getNext()
		{
			return nextAdd;
		}
};

class LinkedList
{
	private:
		Node *Head;
		Node *Tail;
	public:
		LinkedList()
		{
			Head = NULL;
			Tail = NULL;	
		}	
		void Enqueue(int d)
		{
			Node *newNode = new Node;
			newNode -> setData(d);
			newNode -> setNext(NULL);
			
			if(Head == NULL)
			{
				Head = newNode;
				Tail = newNode;
			}
			else
			{
				Tail -> setNext(newNode);
				Tail = newNode;
			}
		}
		void Dequeue()
		{
			if(Head == NULL)
			{
				cout << "\n\n*** Queue is Empty ***";
			}
			else
			{
				Node *ptr = Head;
				while(ptr != NULL)
				{
					cout << ptr -> getData() << " ";
					ptr = ptr -> getNext();
				}
			}
		}
		void deleteFirstNode()
		{
			Head = Head -> getNext();
		}
};

main()
{
	int number , a;
	LinkedList L;
	cout << "Enter Number You Want To Insert : ";
	cin >> number;
	cout << "\n\nEnter Numbers Randomly : ";
	for(int i=1; i<=number; i++)
	{
		cin >> a;
		if(a%2 == 0)
		{
			L.Enqueue(a);
		}
	}
	cout << "\n\nThe Even Numbers Are : ";
	L.Dequeue();
	cout << "\n\nAfter Removing the First Even Number : ";
	L.deleteFirstNode();
	L.Dequeue();
	getch();
	return 0;
}