#include <bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair<int,int> template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { //ios::sync_with_stdio(false); //cin.tie(nullptr); string n; getline(cin, n); vector<long long>a(3); rep(i, 3) { string s; getline(cin, s); rep(i, s.size()) { if (' ' == s[i]) { cout << "\"assert\"" << endl; return 0; } } a[i] = stoll(s); } vector<long long>v = { a[0] + a[1],a[1] + a[2],a[0] + a[2] }; sort(all(v)); v.erase(unique(all(v)), v.end()); reverse(all(v)); cout << v[1] << endl; return 0; }