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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long r, g, b;
  long long dr, dg, db;
  cin >> r >> g >> b;
  long long ans1 = r / 3 + g / 3 + b / 3;
  long long ans2 =
      max(r - 1ll, 0ll) / 3 + max(g - 1ll, 0ll) / 3 + max(b - 1ll, 0ll) / 3 + 1;
  long long ans3 =
      max(r - 2ll, 0ll) / 3 + max(g - 2ll, 0ll) / 3 + max(b - 2ll, 0ll) / 3 + 2;
  if (r == 0 || g == 0 || b == 0) {
    ans2 = 0;
  }
  if (r <= 1 || g <= 1 || b <= 1) {
    ans3 = 0;
  }
  cout << max(ans1, max(ans2, ans3));
  return 0;
}
