#include <iostream>
#include <algorithm>
#include <array>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define whole(f,x,...) ([&](decltype((x)) y) { return (f)(begin(y), end(y), ## __VA_ARGS__); })(x)
using namespace std;
int main() {
    array<int,3> a; repeat (i,3) cin >> a[i]; whole(sort, a);
    int ans = 0;
    ans += a[0];
    a[2] -= a[0];
    a[1] -= a[0];
    a[0] = 0;
    while (a[1] >= 1 and a[2] >= 3) {
        ans += 1;
        a[1] -= 1;
        a[2] -= 3;
        if (a[1] > a[2]) swap(a[1], a[2]);
    }
    ans += a[2] / 5;
    a[2] %= 5;
    cout << ans << endl;
    return 0;
}