#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,0,-1},dy={-1,0,1,0};
bool inside(int y,int x,int h,int w){
	if(y<h && y>=0 && x<w && x>=0) return true;
	return false;
}





int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	string n;
	getline(cin, n);
	string s;
	getline(cin, s);
	bool ok = true;
	rep(i,s.size()){
		if(s.at(i) == ' ') ok = false;
	}
	if(!ok){
		cout << "\"assert\"" << endl;
		return 0;
	}
	vector<ll> a(3);
	rep(i,s.size()){
		a.at(0) *= 10;
		a.at(0) += s.at(i) - '0';
	}
	cin >> a.at(1) >> a.at(2);
	vector<ll> sum;
	rep(i,3){
		for(int j = i + 1; j < 3; j++){
			sum.pb(a.at(i) + a.at(j));
		}
	}
	sort(sum.rbegin(),sum.rend());
	sum.erase(unique(sum.begin(),sum.end()), sum.end());
	cout << sum.at(1) << endl;
}