#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
  int a,b,c;
  cin >>a>>b>>c;
  int ans=0;
  ans = max(a+b,ans);
  ans = max(a+c,ans);
  ans = max(b+c,ans);
  cout << ans << endl;
  
}

#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
    int n, q, flip = 0;
    string s;
    cin >> n >> s >> q;
    while (q --)
    {
        int t, a, b;
        cin >> t;
        cin >> a >> b;
        a --;
        b --;
        if (t == 2)
            flip = 1 - flip;
        else
        {
            if (flip)
            {
                if (a >= n)
                    a -= n;
                else
                    a += n;
                if (b >= n)
                    b -= n;
                else
                    b += n;
            }
            swap(s[a], s[b]);
        }
    }
    if (flip)
    {
        for (int i = 0; i < n; ++i)
        {
            swap(s[i], s[i + n]);
        }
    }
    cout << s << '\n';
    return 0;
}