#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define SZ(x) x.size()
#define fi first
#define se second
const int INF = 1e9;
using namespace std;

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class T>
inline bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>
inline bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(20);

    int N; cin >> N;
    string S; 
    getline(cin,S);
    getline(cin,S);
    if(S.find(" ")!=string::npos){
        cout << "\"assert\"" << endl;
        return 0;
    }
    int a=stoll(S,nullptr,10);
    int b,c; cin >> b >> c;
    vi v;
    v.eb(a+b); v.eb(a+c); v.eb(b+c);
    int ma=0;
    for(auto a:v){
        chmax(ma,a);
    }
    int ma2=0;
    for(auto a:v){
        if(a!=ma){
            chmax(ma2,a);
        }
    }
    cout << ma2 << endl;
}