#include <iostream>
#include <algorithm>
#include <vector>

void solve() {
    std::vector<int> xs(3);
    for (auto& x : xs) std::cin >> x;
    std::sort(xs.begin(), xs.end());

    int d = xs[0];
    int ans = d;
    for (auto& x : xs) x -= d;

    while (xs[1] >= 1 && xs[2] >= 3) {
        ++ans;
        xs[1] -= 1;
        xs[2] -= 3;
        if (xs[1] > xs[2]) std::swap(xs[1], xs[2]);
    }

    ans += xs[2] / 5;

    std::cout << ans << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}