/*
#include <stdlib.h>
int main()
{
printf("Hello world!\n");
return 0;
}
a, b의 곱 = a와b의최대공약수 * a와b의최소공배수
최소공배수=a,b의 곱/a와b의최대공약수
1565
#include <stdio.h>
int gcd(int p, int q){ if(p==0) return q; return gcd(q%p, p);}
long long int lcm(int a,int b)
{
long long int gop = (long long int)a * b;
return gop / gcd(a,b);
}
int main()
{
int a, b;
scanf("%d%d", &a, &b);
printf("%lld\n", lcm(a, b));
}
1556
#include <stdio.h>
int n;
long long int f(int n)
{
int i,j=1;
for(i=1; i<=n; i++)
{
j=j*i;
}
return j;
}
int main()
{
scanf("%d", &n);
printf("%lld\n", f(n));
}
1559
#include <stdio.h>
int n, m;
long long int f(int n, int m)
{
long long int d;
d=(long long int)n+(long long int)m;
return d;
}
int main()
{
scanf("%d%d", &n, &m);
printf("%lld\n", f(n, m));
}
1569
#include <stdio.h>
int n, k, d[1010];
int findi(int k)
{
int i;
for(i=1; i<=n; i++)
{
if(k == d[i])
{
return i;
}
}
return -1;
}
int main()
{
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%d", &d[i]);
scanf("%d", &k);
printf("%d\n", findi(k));
}
1602
#include <stdio.h>
double f(double a)
{
if(a<0)
{
return -a;
}
else
{
return a;
}
}
main()
{
double a;
scanf("%lf",&a);
printf("%.10g",f(a));
}
*/
#include <stdio.h>
long long int n;
int f(long long int n)
{
int arr[n];
if(arr[n]==arr[1]&& arr[n-1]&&arr[2])
{
}
}
int main()
{
scanf("%lld", &n);
printf("%d\n", f(n));
return 0;
}