#include<stdio.h>
#include<stdlib.h>
int top=-1,size;
int arr[25];

int (isFull(){
    if(top==size-1)
       return 1;
     else
       return 0;
}

int isEmpty(){
    if(isEmpty())
      return 1;
    else
      return 0;
        
    }
}
void push(){
    if(isFull())
       printf("stack is  full\n");
     else
      arr[++top]=num;
}
void pop(){
    if(isEmpty())
       printf("stack is empty");
     else
       top--;
       
}
int peek(){
    ans=peek();
    if(top!=size)
       peek();
}
void traverse(){
    
}
return 0;
}