/*#include <stdio.h>
int n, m;
long long int f(int s, int p)
{
return (long long int)s+p;
}
int main()
{
scanf("%d%d", &n, &m);
printf("%lld\n", f(n, m));
}
*/
/*#include <stdio.h>
int n;
long long int f(int s)
{
long long int p, t=1;
for(p=1;p<=s;p=p+1)
{
t=t*p;
}
return (long long int)t;
}
int main()
{
scanf("%d", &n);
printf("%lld\n", f(n));
}
*/
/*#include <stdio.h>
int n;
int prime(int s)
{
int p, r=0;
for(p=2;p<s;p=p+1)
{
if(s%p==0)
r=r+1;
}
return r==0;
}
int main()
{
scanf("%d", &n);
if(prime(n)) printf("prime");
else printf("composite");
return 0;
}
*/
/*#include <stdio.h>
int n;
void f(int s)
{
int p, r=0;
for(p=2;p<s;p=p+1)
{
if(s%p==0)
{
r=r+1;
}
}
if(r==0)
{
printf("prime");
}
else
{
printf("composite");
}
}
int main()
{
scanf("%d", &n);
f(n);
return 0;
}
*/
/*#include <stdio.h>
int n, d[110];
int f()
{
int s, t=-1, r;
for(s=0;s<n;s=s+1)
{
if(d[s]>t)
{
t=d[s];
r=s+1;
}
}
return r;
}
int main()
{
scanf("%d", &n);
for(int i=0; i<n; i++)
scanf("%d", &d[i]);
printf("%d", f());
return 0;
}
*/