#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <sstream>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<(DUMP(),__VA_ARGS__).str()<<" ["<<__LINE__<<"]"<<endl)
struct DUMP:ostringstream{template<class T>DUMP &operator,(const T&t){if(this->tellp())*this<<", ";*this<<t;return *this;}};
#else
#define dump(...)
#endif
typedef double R;

const double pi = acos(-1);

int f(int& x1,int& x2){
    int t1 = min(x2/3,x1);
    int t2 = x2/5 + x1/5;
    if(t1 < t2){
        x1 -= t1;
        x2 -= t1*3;
        return t2;
    } else {
        x1 -= x1/5*5;
        x2 -= x2/5*5;
        return t1;
    }
}

int main(){
    int a[3];
    while(cin>>a[0]){
        rep(i,2)cin>>a[i+1];
        sort(a,a+3);
        int ans=0;
        {
            int x = min({a[0],a[1],a[2]});
            ans += x;
            rep(i,3)a[i]-=x;
            dump(x);
        }
        {
            int t = f(a[1],a[2]);
            int u = f(a[2],a[1]);
            ans += t+u;
        }
        cout << ans << endl;
    }
}