#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  cin.ignore();
  string s;
  getline(cin,s);
  rep(i,sz(s)) if(s[i]==' '){
    cout << "assert" << endl;
    return 0;
  }
  vector<ll> V={stoll(s)};
  getline(cin,s); V.pb(stoll(s));
  getline(cin,s); V.pb(stoll(s));
  set<ll> st;
  st.insert(V[0]+V[1]);
  st.insert(V[0]+V[2]);
  st.insert(V[1]+V[2]);
  st.erase(*st.rbegin());
  cout << *st.rbegin() << endl;
  return 0;
}