#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int a[3]; rep(i,3)cin >> a[i]; sort(a,a+3); int ans = 0; ans += a[0]; a[1] -= a[0]; a[2] -= a[0]; a[0] -= a[0]; while(true){ if(a[1] > a[2])swap(a[1], a[2]); if(a[1] > 0){ if(a[2] < 3)break; ans++; a[1]--; a[2] -= 3; }else{ if(a[2] < 5)break; ans++; a[2] -= 5; } } cout << ans << endl; return 0; }