#include <iostream>
#include <algorithm>
using namespace std;
int main(){
    int n;
    cin>>n;
    int a[n+1];
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+n+1);
    int j=n;
    while(a[j]==a[n]){
        j--;
    }
    cout<<a[j];
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int a[110];
int main()
{
	int n, ma = 0, g = 0;
	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> a[i];
			if(a[i] > a[ma])
				a[ma] = a[i];
	}
	for(int i = 0; i < n; i++)
		if(a[i] == a[ma])
			g++;
	sort(a,a+n,greater<int>());//内置类型的由大到小排序
	for(int i = 0; i < n; i++){
		cout << a[i+g];
		break;
	}
	 	return 0;
}