/*
#include<stdio.h>
#define MAX 5
int n;
int stack[100];
int top;
void push(int a)
{
if (top>=MAX)
{
printf("더 이상 삽입하지마\n");
}
else
{
stack[top]=a;
top++;
}
}
void pop()
{
if (top<=0)
{
printf("더이상 뺴지마\n");
}
else
{
top--;
stack[top]=0;
}
}
void print()
{
for (int i=MAX-1; i>-1; i--)
{
printf("%d\n",stack[i]);
}
}
int main()
{
int k;
top = 0;
for(;;)
{
printf("1>push, 2>pop, 3>print:");
scanf("%d", &n);
switch(n)
{
case 1:
printf("input data :> ");
scanf("%d", &k);
push(k);
break;
case 2:
pop();
break;
case 3:
print();
break;
}
}
}
*/
#include <stdio.h>
int n[1000000],i,top=0;
int stack[1000000];
void push()
{
}
void pop(int k[1000000])
{
stack[top]=k[i];
stack[top]=0;
i++;
top++;
}
void print()
{
for (i=0; i<1000000; i++){
}
}
int main()
{
scanf("%d",&n);
pop()
print();
}