#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline ll time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int a,b,c; cin >> a >> b >> c;
    int res = 0;
    while(1){
        int x = max({a,b,c});
        int y = min({a,b,c});
        b = a+b+c-x-y;
        a = y;
        c = x;
        if(a and b and c){
            res += a;
            b -= a;
            c -= a;
            a = 0;
        }
        else if(b and 3 <= c){
            res++; b--; c -= 3;
        }
        else if(5 <= c){
            res++; c -= 5;
        }
        else break;
    }
    cout << res << endl;
}