Stack_p

#include <stdio.h>
int stack[100],n,i,top=-1,choice=0;
void Push();
void Pop();
void display();

int main() {
    printf("\nenter the no. of elements");
    scanf("%d",&n);
    while(choice!=4)
    {
        printf("\n1.Push\n 2.Pop\n3.display\n4.Exit");
        printf("\nenter choice");
        scanf("%d",&choice);
        switch(choice)
        {
            case 1:
            {
                Push();
                break;
            }
            case 2:
            {
                Pop();
                break;
            }
            case 3:
            {
                display();
                break;
            }
            case 4:
            {
                break;
            }
            default:
             printf("\ninvalid");
             
        };
    }
	
	return 0;
}

void Push()
{
    int item;
    if(top==n)
    {
        printf("\noverflow");
    }
    else
    {
        printf("\nenter the item");
        scanf("%d",&item);
        top=top+1;
        stack[top]=item;
    }
}

void Pop()
{
    int item;
    if(top==-1)
    {
        printf("\nempty");
    }
    else
    {
        top=top-1;
    }
}

void display()
{
    if(top==-1)
    {
        printf("\nstack empty");
    }
    else
    {
        for(int i=top;i>=0;i--)
        {
            printf("\n list of elements are");
            printf("%d\n",stack[i]);
        }
    }
}