/*
#include <stdio.h>
int main()
{
int a, b, c, d,n, x[10];
int y[10], arr[11][11] = {}, i, j, k = 1, counter = 0, pc = 1;
for(i = 1; i <= 10; i++){
for(j = 1; j <= 10; j++){
scanf("%d", &arr[i][j]);
}
}
scanf("%d", &n);
for(i = 1; i <= n; i++){
scanf("%d %d", &x[i], &y[i]);
}
for(i = 1; i <= 10; i++){
for(j = 1; j <= 10; j++){
if(arr[i][j] >= 1){
a = j+1;
b = j-1;
c = i+1;
d = i-1;
counter = 0;
while(a <= 10 && arr[i][a] != -1 && counter < arr[i][j]){
if(arr[i][a]==0) arr[i][a]= -2;
a++;
counter++;
}
counter = 0;
while(b >= 1 && arr[i][b] != -1 && counter < arr[i][j]){
if(arr[i][b]==0) arr[i][b] = -2;
b--;
counter++;
}
counter = 0;
while(c <= 10 && arr[c][j] != -1 && counter < arr[i][j]){
if(arr[c][j] == 0) arr[c][j] = -2;
c++;
counter++;
}
counter = 0;
while(d >= 1 && arr[d][j] != -1 && counter < arr[i][j]){
if(arr[d][j] == 0) arr[d][j] = -2;
d--;
counter++;
}
arr[i][j] = -2;
}
}
}
for(i = 1; i <= n; i++){
if(arr[x[i]][y[i]] == 0){
arr[x[i]][y[i]] = k;
}
k++;
}
for(i = 1; i <= 10; i++){
for(j = 1; j <= 10; j++){
printf("%d ", arr[i][j]);
}
printf("\n");
}
printf("Character Information\n");
for(i = 1; i <= n; i++){
if(arr[x[i]][y[i]] >= 0){
printf("player %d survive\n", i);
}
else{
printf("player %d dead\n", i);
}
}
}
함수 function (기능) : 명령의 묶음
*/
//#include <stdio.h>
//int n=5; //전역변수
//
//void star()
//{
// int i;
// for(i=1;i<=n;i++)
// printf("*");
//}
//void star(int n)
//{
// int i;
// for(i=1;i<=n;i++)
// printf("*");
//}
//int f(int x)
//{
// return x+10;
////}
//함수 원형
//반환자료형 함수이름(매개변수)
//char f(int x, int y, char z)
//{
// return 'a';
//}
//
//int main()
//{
// int n,m=10;
// scanf("%d",&n);
// printf("%c",f(n,m, 'a'));
// //star(n);
// return 0;
//}
/*
#include <stdio.h>
void f()
{
printf("123");
return ;
}
int main()
{
f();
return 0;
}
#include <stdio.h>
int n;
int f(int n){
if(n == 1){
printf("hello");
}
else{
printf("world");
}
}
int main()
{
scanf("%d", &n);
f(n);
return 0;
}
#include <stdio.h>
int n;
char grade(int n)
{
if(n >= 90) return 'A';
else if(n >= 80) return 'B';
else if(n >= 70) return 'C';
else if(n >= 60) return 'D';
else return 'F';
}
int main()
{
scanf("%d", &n);
printf("%c", grade(n));
return 0;
}
#include <stdio.h>
int n;
long long int f(int n)
{
long long int k = 0;
for(int i = 1; i <= n; i++){
k = k + i;
}
return k;
}
int main()
{
scanf("%d", &n);
printf("%lld\n", f(n));
}
#include <stdio.h>
int n;
int f(int n)
{
int k = 0, a = 1;
for(int i = 1; i <=n; i++){
if(n % i == 0){
k++;
}
}
return k;
}
int main()
{
scanf("%d", &n);
printf("%d\n", f(n));
}
#include <stdio.h>
int n, a, b, d[1010];
long long int subsetsum(int n, int b)
{
long long int k = 0;
for(int i = a; i <= b; i++){
k = k + d[i];
}
return k;
}
int main()
{
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%d", &d[i]);
scanf("%d %d", &a, &b);
printf("%lld\n", subsetsum(a, b));
}
*/
#include <stdio.h>
int n, d[110];
int f()
{
for(int i = 0; i < n; i++){
}
}
int main()
{
scanf("%d", &n);
for(int i=0; i<n; i++)
scanf("%d", &d[i]);
printf("%d", f());
return 0;
}