#include <stdio.h>

#define MAX 100

typedef struct pilha{
    int dado[MAX];
    int topo;
} stack;

void makestck(stack *p){
    p->topo = -1;
    return;
}

int isempty(stack *p){
    return p->topo == -1;
}

int isfull(stack *p){
    return p->topo == MAX - 1;
}


void insert(int x, stack *p){
    if(isfull(p)) printf("Pilha Cheia\n");
    else
    {
        p->topo++;
        p->dado[p->topo] = x;
    }

}

int removi(stack *p)
{
    if(!isempty(p))
    {
        return p->dado[p->topo--];
    }
    else return -1;
}

int main()
{


    stack k, q;
    makestck(&k);
    makestck(&q);
    printf("Entre com o numero de elementos: ");
    int number;
    scanf("%d", &number);
    int i, aux;
    for(i = number; i > 0; --i)
    {
        insert(i, &k);
    }
    while(!isempty(&k))
    {
        insert(removi(&k), &q);
    }
    while(!isempty(&q))
    {
        printf("%d ", removi(&q));
    }


    return 0;
}