#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int color[3];

bool check(int c) {
    int m = 0, l = 0;
    for (int i = 0; i < 3; i++) {
        if (color[i] >= c) {
            m += (color[i] - c) / 2;
        } else {
            l += c - color[i];
        }
    }
    return m >= l;
}

int solve() {
    int ub = color[0]+color[1]+color[2]+1, lb = 0;
    while (ub - lb > 1) {
        int mid = (ub + lb) / 2;
        if (check(mid)) {
            lb = mid;
        } else {
            ub = mid;
        }
    }
    return lb;
}

void input() {
    for (int i = 0; i < 3; i++) cin >> color[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}