#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
const long double PI = 3.14159265358979323846;
const long long mod = 1e+9 + 7;
const int INFi = INT_MAX;
const long long INF = (long long)1e+9 + 7;
const int N = 1200300, LOGN = 30, V = N * LOGN;
long long dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
int t = 1;
long long a, b, c, ans;
string second;
void MAIN() {
  cin >> a >> b >> c;
  ans = 0;
  ans = max(ans, a / 3 + b / 3 + c / 3);
  if (a > 0 && b > 0 && c > 0)
    ans = max(ans, 1 + (a - 1) / 3 + (b - 1) / 3 + (c - 1) / 3);
  if (a > 1 && b > 1 && c > 1)
    ans = max(ans, 2 + (a - 2) / 3 + (b - 2) / 3 + (c - 2) / 3);
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(10);
  ;
  mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
  ;
  while (t--) {
    MAIN();
  }
}

### Prompt

Your task is to create a Cpp solution to the following problem:

Fox Ciel has some flowers: r red flowers, g green flowers and b blue flowers. She wants to use these flowers to make several bouquets. There are 4 types of bouquets:

  * To make a "red bouquet", it needs 3 red flowers. 
  * To make a "green bouquet", it needs 3 green flowers. 
  * To make a "blue bouquet", it needs 3 blue flowers. 
  * To make a "mixing bouquet", it needs 1 red, 1 green and 1 blue flower. 



Help Fox Ciel to find the maximal number of bouquets she can make.

Input

The first line contains three integers r, g and b (0 ≤ r, g, b ≤ 109) — the number of red, green and blue flowers.

Output

Print the maximal number of bouquets Fox Ciel can make.

Examples

Input

3 6 9


Output

6


Input

4 4 4


Output

4


Input

0 0 0


Output

0

Note

In test case 1, we can make 1 red bouquet, 2 green bouquets and 3 blue bouquets.

In test case 2, we can make 1 red, 1 green, 1 blue and 1 mixing bouquet.

### Response

```cpp
#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
const long double PI = 3.14159265358979323846;
const long long mod = 1e+9 + 7;
const int INFi = INT_MAX;
const long long INF = (long long)1e+9 + 7;
const int N = 1200300, LOGN = 30, V = N * LOGN;
long long dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
int t = 1;
long long a, b, c, ans;
string second;
void MAIN() {
  cin >> a >> b >> c;
  ans = 0;
  ans = max(ans, a / 3 + b / 3 + c / 3);
  if (a > 0 && b > 0 && c > 0)
    ans = max(ans, 1 + (a - 1) / 3 + (b - 1) / 3 + (c - 1) / 3);
  if (a > 1 && b > 1 && c > 1)
    ans = max(ans, 2 + (a - 2) / 3 + (b - 2) / 3 + (c - 2) / 3);
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(10);
  ;
  mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
  ;
  while (t--) {
    MAIN();
  }
}

```