/*#include<stdio.h>
// Function
int vvvvv(int a, int b) {
return a+b;
}
// Function
int main() {
int x, y;
scanf("%d %d", &x, &y);
printf("%d", vvvvv(x, y) + vvvvv(x, y));
}*/
/*#include<stdio.h>
char f()
{
printf("hello");
}
int main()
{
f();
return 0;
}*/
/*#include<stdio.h>
int f()
{
printf("123");
}
int main()
{
f();
return 0;
}*/
/*#include<stdio.h>
char f()
{
printf("*");
}
int main()
{
f();
return 0;
}*/
/*#include<stdio.h>
int f()
{
for(int i=0;i<2;i++)
{
printf("*");
}
}
int main()
{
f();
return 0;
}*/
/*#include<stdio.h>
char f()
{
return 'A';
}
int main ()
{
printf("%c",f());
return 0;
}
*/
/*#include<stdio.h>
int n,k,d[1010]= {};
int lower_bound(int k)
{
for (int i=1; i<=n; i++)
{
if(d[n]<k)
{
return n+1;
}
if (k<=d[i])
{
return i;
break;
}
}
return k;
}
int main()
{
scanf("%d",&n);
for(int i=1; i<=n; i++)
{
scanf("%d",&d[i]);
}
scanf("%d",&k);
printf("%d\n",lower_bound(k));
}*/
/*//21
//1 2 5 7 9 12 16 18 19 20 35 37 39 40 41 46 47 48 49 50 461
#include<stdio.h>
int n,k,d[1010];
int upper_bound(int k)
{
for (int i=n; i>=1; i--)
{
if(d[n]<=k)
{
return n+1;
}
else if(n==1)
{
return 1;
}
else if (d[i]>=k&&d[i-1]<=k)
{
return i;
}
}
return k;
}
int main()
{
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%d", &d[i]);
scanf("%d", &k);
printf("%d\n", upper_bound(k));
}*/
/*#include<stdio.h>
int mymax(int x, int y)
{
if(x>=y)
{
return x;
}
else if(y>=x)
{
return y;
}
}
main()
{
int a, b;
scanf("%d %d", &a, &b);
printf("%d", mymax(a, b));
}*/
/*#include<stdio.h>
int mymin(int x, int y)
{
if(x>=y)
{
return y;
}
else if(y>=x)
{
return x;
}
}
main()
{
int a, b;
scanf("%d %d", &a, &b);
printf("%d", mymax(a, b));
}*/
/*#include <stdio.h>
int f(int i)
{
int v = i;
int sum = 0;
while (1)
{
if (v == 0)
{
break;
}
sum = sum+(v % 10);
v = v / 10;
}
return sum;
}
int main()
{
int n,sum;
scanf("%d", &n);
while (1)
{
if (n < 10)
{
break;
}
n=f(n);
}
printf("%d",n);
return 0;
}*/