class stack
{
           int top,s[100],i;
public:
            stack();
	void push(int a);
	int pop();
	void display();

};

stack::stack()
{
   top=0;
   i=0;
}

void stack::push(int a)
{
   if(top==MAX_NODES)
   {
     cout<<endl<<"Stack is full";
   }
   else
   {
     s[top]=a;
     top++;
   }

}

int stack::pop()
{
   if(top==0)
   {
     cout<<endl<<"Stack is empty";
     return 0;
   }
   else
   {
     top--;
     return(s[top]);
   }
}

void stack::display()
{
 int j;
 for(j=0;j<top;j++)
 {
   cout<<endl<<s[j];
 }
}
int main()
{
stack sss;
sss.push(111);
sss.pop();
sss.display();
}