#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define rd(a) cin>>(a)
#define RD(a,b) cin>>(a)>>(b)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
typedef pair<int,int> P;

int main() {
  ll a[3];
  rep(i,3) cin >> a[i];
  ll ans=min(a[0],min(a[1],a[2]));
  rep(i,3) a[i]-=ans;
  sort(a,a+3,greater<int>());
  while(a[0]>=2) {
    a[0]-=2;
    a[2]++;
    if(a[0] && a[1] && a[2]) {
      ans++;
      a[0]--;
      a[1]--;
      a[2]--;
    }
    sort(a,a+3,greater<int>());
  }
  pr(ans);
  return 0;
}