#include "bits/stdc++.h"
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define put(a) cout<<a<<"\n"
#define all(a)  (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define oorret 0
#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }


int main() {
	int n;
	cin >> n;
	vector<string> a(3);
	vector<ll> b(3);
	getline(cin, a[0]);
	REP(i, 3) {
		if (getline(cin, a[i])) {
		}
		else {
			cout << '"';
			cout << "assert";
			cout << '"';
			cout << endl;
			return 0;
		}
	}
	REP(i, 3) {
		b[i] = stol(a[i]);
	}
	vector<ll> c(3);
	c[0] = b[0] + b[1];
	c[1] = b[0] + b[2];
	c[2] = b[1] + b[2];
	sort(all(c), greater<>());
	if (c[1] != c[0]) {
		put(c[1]);
	}
	else {
		put(c[2]);
	}
	return 0;
}