#include <bits/stdc++.h>
using namespace std;
int main()
{
    int a, b, c, d;
    cin >> a>> b>> c;
    d = a - b + c;
    cout << d;
}
#include<bits/stdc++.h>
//Ctrl + B
using namespace std;
#define endl '\n'
#define nitro {std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);}
#define pi 3.141592653589793
#define mod 1000000007
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(), v.end()
#define dbg(x) cout << x << '\n';
#define case_g(x) cout<<"Case "<<x<<": ";
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef unsigned long ul;
typedef std::vector<int> vi;
typedef std::vector<ll> vl;
typedef std::vector<bool> vb;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
typedef std::pair<int, bool> pib;
typedef std::vector<pii> vii;
typedef std::vector<pll> vll;
typedef std::vector<pib> vib;
typedef std::unordered_map<int, int> umapii;
typedef std::unordered_map<ll, ll> umapll;
typedef std::unordered_map<int , bool> umapib;
typedef std::map<int, int> mapii;
typedef std::map<ll, ll> mapll;
typedef std::map<int, bool> mapib;

ll ncr(ll n, ll r){//ncr formula
    ll m=min(r,n-r);
    ll ans=1;
    for(int i=1;i<=m;i++){
        ans=ans*(n-i+1)/i;
    }
    return ans;
}

ll modpow(ll a, ll b) { //modulo power
    ll result = 1, M=mod;
    while(b!=0) {
        if(b&1) {
            result = ((result%M)*(a%M))%M;
        }
        a = ((a%M)*(a%M))%M;
        b >>= 1;
    }
    return result;
}

ll modinv(ll a) { //modulo inverse
    ll m = mod, y = 0, x = 1;
    while (a > 1) {
        ll q = a / m, t = m;
        m = a % m;
        a = t;
        t = y;
        y = x - q * y;
        x = t;
    }
    return x < 0 ? x + mod : x;
}

void solve() 
{
    vi a(3);
    for(int i=0;i<3;i++)
    {
        cin>>a[i];
    }
    sort(all(a));
    cout<<a[1]+a[2];
}

int main() 
{
    #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    nitro
    int tc;
    tc =1;
    //cin >> tc;
    for(int i=1; i<=tc; ++i) 
    {
        //case_g(i);
        solve();
    }
}
