#include <bits/stdc++.h>
using namespace std;
long long st0[3];
int main() {
  long long i, j, k, l, n, m, a, t, s, x, y;
  cin >> st0[0] >> st0[1] >> st0[2];
  sort(st0, st0 + 3);
  if (st0[0] >= 1 && (st0[1] - st0[0]) % 3 == 2 && (st0[2] - st0[0]) % 3 == 2) {
    k = st0[0] - 1;
    k += (st0[1] - st0[0] + 1) / 3;
    k += (st0[2] - st0[0] + 1) / 3;
  } else {
    k = st0[0];
    k += (st0[1] - st0[0]) / 3;
    k += (st0[2] - st0[0]) / 3;
  }
  cout << k << endl;
  return 0;
}

### Prompt

Please create a solution in cpp 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>
using namespace std;
long long st0[3];
int main() {
  long long i, j, k, l, n, m, a, t, s, x, y;
  cin >> st0[0] >> st0[1] >> st0[2];
  sort(st0, st0 + 3);
  if (st0[0] >= 1 && (st0[1] - st0[0]) % 3 == 2 && (st0[2] - st0[0]) % 3 == 2) {
    k = st0[0] - 1;
    k += (st0[1] - st0[0] + 1) / 3;
    k += (st0[2] - st0[0] + 1) / 3;
  } else {
    k = st0[0];
    k += (st0[1] - st0[0]) / 3;
    k += (st0[2] - st0[0]) / 3;
  }
  cout << k << endl;
  return 0;
}

```