#include<bits/stdc++.h>
#define deb(x) cout<<#x<<" "<<x<<endl;
#define int long long

using namespace std;
const int mod = 1e9 + 7;
const int MAX = 2e5+ 5;
const int N = 5e4 + 5;
vector< pair<int,int> >a[N];
vector<int>g[MAX];

int mypow(int x, int n ){
	
	if(n == 0){
		return 1;
	}
	
	int xn2 = mypow(x,n/2)%mod;
	int xn = xn2*xn2;
	xn%=mod;
	if(n & 1){
		xn = (xn%mod * x%mod)%mod;
	}
	
	return xn;
}


void solve(){
   
  vector<int>temp(3);
  for(int i =0 ; i < 3 ; i ++)cin >> temp[i];
  sort(temp.begin(),temp.end());
  
  cout<<temp[2] + temp[1]<<endl;   
   
}
 

signed main(){
	
 	int t = 1;
// 	 cin >> t;
	
 	while(t--){
 		solve();
 	}
   
	return 0;
}
        
 
#include <iostream>

using namespace std;

int main()
{
    int n,a,b;
    cin>>n>>a>>b;
    cout<<(n-a)+b;
    return 0;
}
