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.
#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, b, c, ans;
  cin >> a >> b >> c;
  int t = a / 3 + b / 3 + c / 3;
  int aa = a % 3;
  int bb = b % 3;
  int cc = c % 3;
  int x = aa + bb + cc;
  if (x >= 5)
    ans = t + x / 3;
  else if ((x == 3 || x == 4) && aa != 0 && bb != 0 && cc != 0)
    ans = t + x / 3;
  else
    ans = t;
  int xx = min(a, min(b, c));
  a = a - xx;
  b -= xx;
  c -= xx;
  if (a % 3 + b % 3 + c % 3 == 4 && xx) xx += 1;
  int d = a / 3 + b / 3 + c / 3 + xx;
  cout << max(ans, d);
}
