#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:32000000")
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
const int N = 100050;
const int M = 20000;
int main() {
  int g, r, b;
  int ans = 0;
  scanf("%d%d%d", &g, &r, &b);
  int mn = min(g, min(r, b));
  for (int i = 0; i <= min(2, mn); i++) {
    int tmp = i;
    tmp += (g - i) / 3 + (r - i) / 3 + (b - i) / 3;
    ans = max(ans, tmp);
  }
  printf("%d\n", ans);
  return 0;
}

### Prompt

Your challenge is to write 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 comment(linker, "/STACK:32000000")
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
const int N = 100050;
const int M = 20000;
int main() {
  int g, r, b;
  int ans = 0;
  scanf("%d%d%d", &g, &r, &b);
  int mn = min(g, min(r, b));
  for (int i = 0; i <= min(2, mn); i++) {
    int tmp = i;
    tmp += (g - i) / 3 + (r - i) / 3 + (b - i) / 3;
    ans = max(ans, tmp);
  }
  printf("%d\n", ans);
  return 0;
}

```