#include <bits/stdc++.h>
#define lop(i, n) for (int i = 0; i < (n); ++i)
#define tc(t) int t; cin>>t; while(t--)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;

int main() {

	ios::sync_with_stdio(false);
	cin.tie(0);
    int a,b,c;
    cin>>a>>b>>c;
    int a1 = a + b;
    int a2 = a + c;
    int a3 = b + c;
    if (a1 <= a2 && a1 <= a3) {
        cout<<(a1);
    } else if (a2 <= a1 && a2 <= a3) {
        cout<<(a2);
    } else if (a3 <= a1 && a3 <= a2) {
        cout<<(a3);
    }



}
#include<bits/stdc++.h> 
#include<random>
#define int long long   
#define pp pair<int,int> 
#define ss second 
#define ff first 
#define pb push_back
#define mod 1000000007
#define mk(arr,n,type)  type *arr=new type[n];
#define sl s1.length();
#define yes cout<< "Yes"<<endl
#define no  cout<< "No"<<endl
#define all(v) (v).begin(),(v).end()
#define  mt mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using namespace std;    
void fastio()
{  
  #ifndef ONLINE_JUDGE
  freopen("INPUT.txt","r",stdin);
  freopen("OUTPUT.txt","w",stdout); 
  #endif
  ios_base :: sync_with_stdio(false); 
  cin.tie(NULL) ; 
  cout.tie(NULL);
}
signed main()
{   
    fastio();
    int t=1;
   // cin>>t;
    while(t--)
    {    
       
      int a[3];
      for(int i=0;i<3;i++)
      cin>>a[i];
      sort(a,a+3);
      cout<<a[0]+a[1];
       
    }
}


// 🍪 🍪 🍪