/*
/*
#include <stdio.h>
int n;
long long int d[110];
long long int f()
{
long long int i, help, most;
if(n==1)
{
return d[1];
}
for(i=1;i<=n;i++)
{
if(d[i]<help)
{
help=d[i];
most=i;
}
}
return help;
}
int main()
{
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%lld", &d[i]);
printf("%lld", f());
return 0;
}
*/
/*
#include <stdio.h>
long long int n;
long long int sqrt()
{
return pow(n,0.5);
}
int main()
{
scanf("%lld", &n);
printf("%d\n", sqrt(n));
return 0;
}
*/
/*
#include <stdio.h>
int n, a, b, d[1010];
long long int maxi(int a, int b)
{
int i;
int number=0, teacheriscomputer=-2147483648;
for(i=a;i<=b;i++)
{
if(d[i]>teacheriscomputer)
{
teacheriscomputer=d[i];
number=i;
}
}
return number;
}
int main()
{
scanf("%d", &n);
for(int i=1; i<=n; i++)
scanf("%d", &d[i]);
scanf("%d%d", &a, &b);
printf("%d\n", maxi(a, b));
}
*/
/*
#include <stdio.h>
int n, k, d[1010];
int lower_bound(int k)
{
int i;
for(i=1;i<=n;i++)
{
if(d[i]>=k)
{
return i;
}
}
return i;
}
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));
}
*/
/*
#include <stdio.h>
double ABS(double Iwillkillhamsu)
{
if (Iwillkillhamsu >= 0)
{
return Iwillkillhamsu;
}
else
{
return Iwillkillhamsu * -1;
}
}
int main(void)
{
double Iwillkillhamsu;
scanf("%lf", &Iwillkillhamsu);
printf("%.10g", ABS(Iwillkillhamsu));
}
*/
//사용자 정의 자료형
// 구조체 구조물
/*#include <stdio.h>
typedef struct
{
int num;
double grade;
}student;
int main(void)
{
student arr2[100];
arr2[0].grade = 4.5;
int a=10, b=5,t;
t=a;
a=b;
b=t; // swap(a,b)
}*/
#include <stdio.h> // fajkehfaiowehfauwhefiuawhe fiuawㅗ댜ㅕ몾ㄷ ㅕㅑ롣 ㅐ랴머데래ㅓㅁㅈ댜려ㅗㅁ ㅑ져돎ㅈ댜ㅕ8롬자 ㄷㄹ매ㅑㅈㄷㄹ
typedef struct
{
int score;
int rank;
}scr;
int main()
{
scr arr[201];
long long int highscore=0;
int getscanfnumber, i, j, w;
scanf("%d", &getscanfnumber);
for(i=1;i<=getscanfnumber;i++)
{
scanf("%d", &arr[getscanfnumber]);
}
for(i=1;i<=getscanfnumber;i++)
{
if(arr[i]>highscore)
{
arr.rank++;
}
}
printf("%d")
}