#include using namespace std; int main() { int stone[3], ans = 0, tmp; cin >> stone[0] >> stone[1] >> stone[2]; sort(stone, stone + 3); stone[2] -= stone[0]; stone[1] -= stone[0]; for(int i = 0; i <= stone[1] / 3; i++) { tmp = min(stone[1] - 3 * i, (stone[2] - i) / 3); tmp = tmp + i + (stone[1] - tmp - 3 * i) / 5 + (stone[2] - i - 3 * tmp) / 5; ans = max(ans, tmp); } cout << ans + stone[0] << endl; return 0; }