/*
#include <stdio.h>
int stack[5]={};
int top = -1;
//top : 마지막 데이터의 위치
void push(int data)
{
top++;
stack[top]=data;
}
int pop()
{
if(top!=-1){ //empty check
//printf("pop : %d\n",stack[top]);
return stack[top--];
}
else{
printf("stack is empty!!!\n");
}
}
int main()
{
push(5);
push(4);
push(3);
while(top!=-1){ //stack의 전부를 pop하기
printf("%d\n",pop());
}
return 0;
}
*/
//1402를 stack으로 풀기
/*
#include <stdio.h>
int stack[1000]={};
int top = -1;
void push(int data) { stack[++top]=data;}
int pop(){ if(top!=-1) return stack[top--];}
int main(){
int n, k;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&k);
push(k);
}
while(top!=-1){
printf("%d ",pop());
}
return 0;
}
0 '\0' NULL
97 'a'
65 'A'
48 '0'
49 '1'
*/
/*
#include <stdio.h>
#include <string.h>
char stack[500]={};
int top=-1;
void push(char data) {stack[++top]=data;}
char pop() {if(top!=-1) return stack[top--];}
int main()
{
char str[500]={};
scanf("%s", str);
for(int i=0;str[i]!='\0';i++){
push(str[i]);
}
while(top!=-1){
printf("%c", pop());
}
return 0;
}*/
/*#include <stdio.h>
int top=-1;
int stack[100000]={};
void push(int data) {stack[++top]=data;}
int pop() {if(top!=-1) return stack[top--];}
int main()
{
int n, k, sum=0;
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%d",&k);
if(k==0)
{
top--;
}
else
{
push(k);
}
}
while(top!=-1)
{
sum+=pop();
}
printf("%d", sum);
return 0;
}
*/
#include <stdio.h>
#include <string.h>
char stack[201];
void push(char data){stack[top++]=data;}
int main()
{
}