#include <bits/stdc++.h>
using namespace std;
struct num {
  int num;
  int mo;
} a[10];
bool cmp(num a, num b) { return a.mo < b.mo; }
int main() {
  for (int i = 1; i <= 3; i++) {
    cin >> a[i].num;
    a[i].mo = a[i].num % 3;
  }
  sort(a + 1, a + 4, cmp);
  long long ans;
  ans = a[1].num / 3 + a[2].num / 3 + a[3].num / 3 + a[1].mo;
  if (a[1].num >= 3 && a[1].mo == 0 && a[2].mo == 2 && a[3].mo == 2) {
    ans++;
  }
  cout << ans;
  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;
struct num {
  int num;
  int mo;
} a[10];
bool cmp(num a, num b) { return a.mo < b.mo; }
int main() {
  for (int i = 1; i <= 3; i++) {
    cin >> a[i].num;
    a[i].mo = a[i].num % 3;
  }
  sort(a + 1, a + 4, cmp);
  long long ans;
  ans = a[1].num / 3 + a[2].num / 3 + a[3].num / 3 + a[1].mo;
  if (a[1].num >= 3 && a[1].mo == 0 && a[2].mo == 2 && a[3].mo == 2) {
    ans++;
  }
  cout << ans;
  return 0;
}

```