#include <bits/stdc++.h>
using namespace std;
int main() {
  int a[3] = {-1}, b, c, i, j, temp, sum = 0;
  cin >> a[0] >> a[1] >> a[2];
  for (i = 0; i < 2; i++)
    for (j = 0; j <= 2 - i - 1; j++) {
      if (a[j] > a[j + 1]) {
        temp = a[j];
        a[j] = a[j + 1];
        a[j + 1] = temp;
      }
    }
  sum = a[0] + (a[1] - a[0]) / 3 + (a[2] - a[0]) / 3;
  if ((a[2] - a[0]) % 3 == 2 && (a[1] - a[0]) % 3 == 2 && a[0] != 0) sum += 1;
  cout << sum;
  return 0;
}

### Prompt

Develop a solution in Cpp to the problem described below:

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;
int main() {
  int a[3] = {-1}, b, c, i, j, temp, sum = 0;
  cin >> a[0] >> a[1] >> a[2];
  for (i = 0; i < 2; i++)
    for (j = 0; j <= 2 - i - 1; j++) {
      if (a[j] > a[j + 1]) {
        temp = a[j];
        a[j] = a[j + 1];
        a[j + 1] = temp;
      }
    }
  sum = a[0] + (a[1] - a[0]) / 3 + (a[2] - a[0]) / 3;
  if ((a[2] - a[0]) % 3 == 2 && (a[1] - a[0]) % 3 == 2 && a[0] != 0) sum += 1;
  cout << sum;
  return 0;
}

```