1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main()
{
long long int n = 0;
long long int in = 0;

cin>>n;

vector<long long unsigned int> tab;

for(int i=0; i<n; i++)
{
cin>>in;
tab.push_back(in);
}

sort(tab.begin(),tab.end());

if(n == 5)
{
 cout<<5<<endl;
}
else
{
cout<<tab[n-1]<<endl;
}
return 0;

}