#include <bits/stdc++.h>
using namespace std;
int main() {
  unsigned long long red, green, blue;
  unsigned long long _3flowers[3];
  unsigned long long _residualflowers[3];
  for (int i = 0; i < 3; i++) {
    int aux;
    cin >> aux;
    _3flowers[i] = aux / 3;
    _residualflowers[i] = aux % 3;
  }
  unsigned long long mixtos = 0;
  if (_residualflowers[0] > 0 && _residualflowers[1] > 0 &&
      _residualflowers[2] > 0)
    mixtos =
        min(_residualflowers[0], min(_residualflowers[2], _residualflowers[1]));
  else if (_residualflowers[0] + _residualflowers[1] > 3 && _3flowers[2] > 0)
    mixtos = 1;
  else if (_residualflowers[0] + _residualflowers[2] > 3 && _3flowers[1] > 0)
    mixtos = 1;
  else if (_residualflowers[2] + _residualflowers[1] > 3 && _3flowers[0] > 0)
    mixtos = 1;
  cout << _3flowers[0] + _3flowers[1] + _3flowers[2] + mixtos << endl;
  getchar();
  return 0;
}

### Prompt

Create a solution in Cpp for 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;
int main() {
  unsigned long long red, green, blue;
  unsigned long long _3flowers[3];
  unsigned long long _residualflowers[3];
  for (int i = 0; i < 3; i++) {
    int aux;
    cin >> aux;
    _3flowers[i] = aux / 3;
    _residualflowers[i] = aux % 3;
  }
  unsigned long long mixtos = 0;
  if (_residualflowers[0] > 0 && _residualflowers[1] > 0 &&
      _residualflowers[2] > 0)
    mixtos =
        min(_residualflowers[0], min(_residualflowers[2], _residualflowers[1]));
  else if (_residualflowers[0] + _residualflowers[1] > 3 && _3flowers[2] > 0)
    mixtos = 1;
  else if (_residualflowers[0] + _residualflowers[2] > 3 && _3flowers[1] > 0)
    mixtos = 1;
  else if (_residualflowers[2] + _residualflowers[1] > 3 && _3flowers[0] > 0)
    mixtos = 1;
  cout << _3flowers[0] + _3flowers[1] + _3flowers[2] + mixtos << endl;
  getchar();
  return 0;
}

```