using namespace std;
#include <iostream>

int main() {
    int n, a, b; cin >> n >> a >> b;
    cout << n - a + b << endl;
    return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pll pair<ll,ll>
#define pii pair<int,int>
#define vll vector<ll>
#define vi vector<int>
#define sz(v) (ll)v.size()
#define all(v) v.begin(),v.end()
#define pq_max priority_queue<ll>
#define pq_min priority_queue <ll, vector<ll>, greater<ll> >
#define debug(x) cout<<#x<<"->"<<x<<endl
#define debug2(x,y) cout<<#x<<"->"<<x<<", "<<#y<<"->"<<y<<endl
#define debug3(x,y,z) cout<<#x<<"->"<<x<<", "<<#y<<"->"<<y<<","<<#z<<"->"<<z<<endl
#define endl '\n'
#define ff first
#define ss second
const ll INF = 4000000000000000000;
const ll mod = 1000000007;
const ll prime1 = 1999999973, prime2 = 1999999943;
void read(vll& arr,ll n){
    for(int i=0;i<n;i++) cin>>arr[i];
}
ll solve(){
    vll arr(3);
    read(arr,3);
    sort(all(arr));
    cout<<arr[2]+arr[1];
    return 0;
}
int main(){
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);                 
    // freopen("minima.in","r",stdin);
    // freopen("minima.out","w",stdout);
    ll T=1;
    // cin>>T;
    for(int i=1;i<=T;i++){
        //cout<<"Case #"<< i <<":";
        solve();
        //cout<<endl;
    }
    return 0; 
}
