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;
const long long mod = 1e9 + 7;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long test = 1;
  while (test--) {
    long long r, g, b;
    cin >> r >> g >> b;
    vector<long long> ans(3, 0);
    long long m = min(r, min(b, g));
    ans[0] = r / 3 + b / 3 + g / 3;
    if (m > 0) {
      ans[1]++;
      ans[1] += (r - 1) / 3 + (b - 1) / 3 + (g - 1) / 3;
    }
    if (m > 1) {
      ans[2] = 2;
      ans[2] += (r - 2) / 3 + (b - 2) / 3 + (g - 2) / 3;
    }
    cout << max(ans[0], max(ans[1], ans[2]));
  }
  return 0;
}
