/*
#include <stdio.h>
int main()
{
int s,a,i,j;
scanf("%2d%2d%2d-%d", &s,&i,&j, &a);
a=a/1000000;
if(a<3)
{
if(a<2)
{
printf("%d/%02d/%02d M", s+1900,i,j);
}
else if(a>=2)
{
printf("%d/%02d/%02d F", s+1900,i,j);
}
}
if(a>=3)
{
if(a<4)
{
printf("%d/%02d/%02d M", s+2000,i,j);
}
else if(a>=4)
{
printf("%d/%02d/%02d F", s+2000,i,j);
}
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int a,n,i,j,m,o;
scanf("%d %d %d",&a,&n,&i);
if(n+i>=60)
{
if(a+(n+i)/60>=24)
{
printf("%d %d", a+(n+i)/60-24, (n+i)%60);
}
else
{
printf("%d %d", a+(n+i)/60, (n+i)%60);
}
}
else
{
printf("%d %d",a,n+i);
}
return 0;
}
*/
/*
#include <stdio.h>
int main()
{
int a,n,i,j,m,o;
scanf("%d %d %d",&a,&n,&i);
printf("%d %d", (a+(n+i)/60)%24, (n+i)%60);
return 0;
}
*/
/*
#include <stdio.h>
int stack[5]={};
int top=-1;
void push(int a)
{
if(top==4)
{
//printf("error : stack is full.\n");
return ;
}
top++;
stack[top]=a;
}
int pop()
{
if(top==-1)
{
//printf("error : stack is empty.\n");
return 0;
}
top--;
return stack[top+1];
}
void view()
{
printf("stack [");
for(int i=0;i<=top;i++)
printf("%d ",stack[i]);
printf("]\n");
}
int main()
{
push(5);
view();
push(3);
view();
pop();
view();
push(10);
view();
push(5);
push(6);
push(7);
view();
push(6);
pop();
view();
pop();
pop();
pop();
pop();
view();
pop();
pop();
pop();
view();
}
*/
//8
//12345678
//
//12,345,678
//
//1
//2
//,
//3
//4
//5
//,
//6
//7
//8
/*
#include <stdio.h>
int stack[1001]={};
int top=-1,i;
void push(int a)
{
if(top==4)
{
return ;
}
top++;
stack[top]=a;
}
int pop()
{
if(top==-1)
{
return 0;
}
top--;
return stack[top+1];
}
void view()
{
printf("%d ",stack[i]);
}
int main()
{
int n,a;
scanf("%d", &n);
for(i=1; i<=n; i++)
{
scanf("%d",&a);
push(a);
}
while(top!=-1)
{
printf("%d ",pop());
}
}
*/