#include <stdio.h>
#define size 5
int stack[size];
int top=-1;
int isempty(){
    return (top==-1);
}
int isfull(){
    return (top==size-1);
}
void push(int n){
    if(isfull()){
        printf("stack is overflow%d\n",value);
    }
    else{
        top++;
        stack[top]=value;
        printf("push element into stack%d\n",value);
    }
}
void pop(int n){
    if(isempty()){
        printf("Underflow\n");
    }
    else{
        printf("pop top ele %d\n",stack[top]);
        top--;
    }
}
void peek(){
    if(isempty()){
        printf("Stack is empty");
    }
    else{
        printf("top of element%d\n",stack[top]);
    }
}
void display(){
    if(isempty()){
        printf("stack is empty\n");
    }
    else{
        printf("element top bottom\n");
        for(int  i=top;;i>=0;i++){
            printf("%d",top[i]);
        }
    }
   
    }
     int main(){
        int 
}
}