/*#include<stdio.h>
int stack[201];
int top=-1;
void push(int data)
{
top++;
stack[top]=data;
}
int to()
{
if(top==-1)return -1;
else return stack[top];
}
int pop()
{
if(top!=-1) return stack[top--];
}
int main()
{
char cmd[201];
int n, i, t, a, b=0;
scanf("%d\n", &n);
for(i=0;i<n;i++)
{
gets(cmd);
if(cmd[1]=='u')
{
b=0;
for(a=6;cmd[a]!=' ';a++)
{
b=(b*10+cmd[a]-'0');
}
push(b);
}
else if(cmd[0]=='t')printf("%d\n", to());
else if(cmd[0]=='p')pop();
else if(cmd[0]=='s')printf("%d\n", top+1);
else if(cmd[0]=='e')
{
if(top==-1)printf("true\n");
else printf("false\n");
}
}
}
#include<stdio.h>
#include<string.h>
int c[102]={};
int top=-1;
int main()
{
char a[102]={}, b[102]={};
int c[102]={};
int i, x, y, z=0, num=0;
int n, m;
gets(a);
gets(b);
x = strlen(a)-1;
y = strlen(b)-1;
//x > y
if(x>y)
{
while(x>=0)
{
if(x>=0) n = a[x--]-'0';
else n=0;
if(y>=0) m = b[y--]-'0';
else m=0;
num=n+m+z;
z = num/10;
num=num%10;
c[++top]=num;
}
}
else
{
while(y>=0)
{
if(x>=0) n = a[x--]-'0';
else n=0;
if(y>=0) m = b[y--]-'0';
else m=0;
num=n+m+z;
z = num/10;
num=num%10;
c[++top]=num;
}
}
if(z!=0)c[++top]+=1;
while(top!=-1)
printf("%d", c[top--]);
}
#include<stdio.h>
#include<string.h>
char stack[50001];
int main()
{
int i, a, b=0;
gets(stack);
a=strlen(stack)-1;
for(i=0;i<=a;i++)
{
if(stack[i]==')')b=b-1;
if(stack[i]=='(')b=b+1;
if(b<0)i=a+1;
}
if(b==0)printf("good");
else printf("bad");
}
sum
top=0;
( top++;
) top--; sum++;
( ) sum+=top;
#include<stdio.h>
#include<string.h>
int top=0;
int main()
{
char a[100001]={};
int b, i, sum=0;
gets(a);
b=strlen(a)-1;
for(i=0;i<=b;i++)
{
if(a[i]=='('&&a[i+1]==')'){sum+=top;i++;}
else if(a[i]=='(')top+=1;
else if(a[i]==')'){top-=1; sum+=1;}
}
printf("%d", sum);
}*/