#include using namespace std; typedef long long ll; typedef long double ld; typedef pair l_l; typedef pair i_i; typedef vector vel; typedef vector vei; typedef vector vec; typedef vector veb; typedef vector ves; typedef vector> ve_vel; typedef vector> ve_vei; typedef vector> ve_vec; typedef vector> ve_veb; typedef vector> ve_ves; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<(int)(n);i++) #define rep2(i,n) for(int i=2;i<(int)(n);i++) #define repk(i,k,n) for(int i=k;i<(int)(n);i++) #define fs first #define sc second #define pub push_back #define pob pop_back #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define maxel(a) *max_element(all(a)) #define minel(a) *min_element(all(a)) #define acc accumulate #define EPS (1e-7) //#define INF (1e9) #define PI (acos(-1)) #define mod (1000000007) typedef long long int64; const int64 INF = 1LL << 58; #define dame { puts("-1"); return 0;} template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } int main(){ cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; cin.ignore(); string s; getline(cin, s); if (count(s.begin(), s.end(), ' ') > 0) { cout << "\"assert\"" << endl; return 0; } int a, b, c; a = stoi(s); cin >> b >> c; vei v(3); v[0] = a + b; v[1] = b + c; v[2] = a + c; v.erase(unique(v.begin(),v.end()),v.end()); sort(rall(v)); cout << v[1] << endl; return 0; }