#include <stdio.h>
#include <stdlib.h>
int top=-1,size=5;
int arr[25];
int isfull()
{
    if(top==size-1){
        return 1;
    }
    else
    return 0;
}
void push(int num){
    if (isfull())
    {
    printf("Stack is full\n");
}
    else
    arr[++top]=num;
}
int isempty()
{
    if(top==-1){
        return 1;
    }
    else
    return 0;
    
}
void pop(int num){
    if(isempty())
    {
        printf("Stack is empty");
    }
    else
    top--;
}
int peek()
{
    if(isempty()){
        return 1;
    }
    else
     return arr[top];
}
void traverse()
{
    for(int i=0;i<top;i++)
    {
        printf("%d",arr[i]);
    }
}

int main()
{
    int k;
    switch(k)
    {
        case 1:
           push();
           break;
        
        case 2:
           pop();
           break;
          
        case 3:
            int c=peak();
            printf("%d",c);
            break;
            
        case 4:
             traverse();
             break;
             
        case 5:
              exit(0);
              
        default:
        printf("Invalid");
    }
}