
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<
pair<int, int>,
null_type,
less<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update> ordered_set;


#define FAST_IO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define pb push_back
#define pii pair<int,int>
const int M=1e9+7;
const int N=200005;

signed main()	{
  FAST_IO
  int t1=1;
  //cin>>t1;
  while(t1--){
    int a[3];
    cin>>a[0]>>a[1]>>a[2];

    sort(a,a+3);

    cout<<a[2]+a[1]<<endl;

  }
}

#include <iostream>
#include<vector>
#include<algorithm>
#include <queue>
#include <cstdio>
#include <numeric>
#include <math.h>
#include <iomanip>
#include <map>  
using namespace std;

int main() {
	int A, B, C,D,E,F,M;
	cin >> A >> B >> C;
	D = A + B;
	E = B + C;
	F = C + A;
	M = max(D, E);
	M = max(M, F);
	cout << M;
}