// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  ll r[3];
  rep(i, 3)cin >> r[i];
  sort(r, r + 3);
  ll ld = 0, rd = 1e7 + 1;
  while(rd - ld > 1){
    ll md = (ld + rd) / 2;
    ll rem = 0;
    rep(i, 3){
      if(r[i] >= md)rem += (r[i] - md) / 2;
    }
    bool b = true;
    rep(i, 3){
      if(r[i] < md){
        if(rem < md - r[i]){
          b = false;
          break;
        }
        rem -= (md - r[i]);
      }
    }
    if(b)ld = md;
    else rd = md;
  }
  cout << ld << endl;
	return 0;
}