#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;

#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MAX 1000050

#define ll long long
#define ld long double
#define lli long long int

#define pb push_back
#define INF 100000000000000
#define mod 1000000007

// trignometric function always give value in Radians only
#define PI acos(-1) //3.1415926535897932384626433832795028
#define dsin(degree) sin(degree*(PI/180.0))
#define dcos(degree) cos(degree*(PI/180.0))
#define dtan(degree) tan(degree*(PI/180.0))

#define rsin(radian) sin(radian)
#define rcos(radian) cos(radian)
#define rtan(radian) tan(radian)

#define counttrailingzeroes(n) __builtin_ctzll(n)
#define countsetbits(n) __builtin_popcountll(n) 

#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define memf(a) memset(a,false,sizeof(a))

#define loop(i,n)  for (lli i = 0; i < n; i++)
#define FOR(i,a,b) for (lli i = a; i < b; i++)

#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define makeuniq(v) v.resize(unique(all(v)) - v.begin()); //only uniq element in vector after this
#define sz(x) int(x.size())
#define F first
#define S second

#define mii map<lli,lli>

#define pii pair<lli,lli>

#define vi vector<lli>
#define vvi vector<vi>
#define vpi vector<pii>
#define vbool vector<bool>

#define seti set<lli>

#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) (a/gcd(a,b))*b
#define abs(x) ((x < 0)?-(x):x)
#define isvowel(v) (0x208222>>(v&0x1f))&1

#define endl '\n'

template <typename Head>
void print(Head&& head)
{
    cout<<head<<endl;
}
template <typename Head, typename... Tail>
void print(Head&& head, Tail... tail)
{
    cout<<head<<" ";
    print(tail...);
}

#define scanarr(a,n) for(lli i=0;i<n;i++)    cin>>a[i];
#define scanvec(a,n) for(lli i=0;i<n;i++){ lli x ; cin>>x; a.pb(x);}

#define printarr(a,n) for(lli i=0;i<n;i++)   cout<<a[i]<<" "; cout<<endl;
#define printvec(vec) for(auto xt : vec) cout<<xt<<" ";    cout<<"\n";

#define FD(N) fixed<<setprecision(N)

#define deb(x) cout<<#x<<" "<<x<<endl;

/*
1D vector -  vi dp(n,value);
*/

lli mceil(lli a,lli b){ return(a/b + (a%b != 0)); }

lli mfloor(lli a,lli b){ return(a/b); }

ll modmul(ll a, ll b,ll MOD = mod) {
    return ((a%MOD) * (b%MOD)) % MOD;
}

ll modadd(ll a, ll b,ll MOD = mod){
    return((a%MOD)+(b%MOD)+MOD)%MOD;
}

ll modsub(ll a, ll b,ll MOD = mod){
    return((a%MOD) - (b%MOD) + MOD)%MOD;
}

lli fastexpo(lli a,lli b ,lli MOD = mod){
    a = a%MOD;
    lli ans=1;
    while(b){
        if(b&1)
            ans=(ans*1ll*a)%MOD;
        a=(a*1ll*a)%MOD;
        b=b/2;
        }
    return ans;
 }


vector<int>all_div[200050];
void alldivisors(){
for(int i=1;i<200050;++i){
        for(int j=i;j<200050;j+=i)
            all_div[j].pb(i);
    }
}


bool ispower2(lli n){
    return(n and (n&(n-1))==0 );
}

bool isp(lli n)
{
    if(n<=1) return 0;
    if(n==2 or n==3) return 1;
    for(lli i=2;i*i<=n;i++)
        if(n%i==0) return 0;
    return 1;
}

int main(){
fastio
lli tt =1;
//cin>>tt;
//alldivisors();
while(tt--)
{
    lli n,x;
    lli a[3];
    scanarr(a,3);
    sort(a,a+3);
    print(a[1]+a[2]);
    
}
return 0;
}
/* Nikkz99 */
#include <bits/stdc++.h>
#define ll long long
#define s string
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    //string w,a; getline(cin,a);
    // stringstream S(a);
   //set<s> d;
  //map<s,ll> F;
    // while(S>>w) { }

    ll A[102];
    for(auto i=0;i<3;i++)
            cin>>A[i];
    sort(A,A+3);
    cout<<A[2]+A[1];
    return 0;
}
