#include using namespace std; #define fs first #define sc second #define pb push_back #define mp make_pair #define eb emplace_back #define ALL(A) A.begin(),A.end() #define RALL(A) A.rbegin(),A.rend() typedef long long LL; typedef pair P; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template T gcd(T a,T b){return b?gcd(b,a%b):a;} const LL mod=1000000007; const LL LINF=1LL<<62; const int INF=1<<30; int dx[]={1,0,-1,0,1,-1,1,-1}; int dy[]={0,1,0,-1,1,-1,-1,1}; int main(){ int n;cin >> n; string s; getline(cin, s); vector a; for (int i = 0; i < n; i++) { string s = ""; getline(cin, s); if(s == ""){ puts("\"assert\""); return 0; } else{ a.pb(stoi(s)); } } vector x; x.pb(a[0] + a[1]); x.pb(a[0] + a[2]); x.pb(a[2] + a[1]); sort(ALL(x)); x.erase(unique(ALL(x)),x.end()); sort(RALL(x)); cout << x[1] << endl; return 0; }