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 int INF = 0x3f3f3f3f;
long long min(long long a, long long b, long long c) {
  return min(a, min(b, c));
}
template <class T>
const T& max(const T& a, const T& b, const T& c) {
  return max(a, max(b, c));
}
template <class T>
const T& min(const T& a, const T& b, const T& c) {
  return min(a, min(b, c));
}
struct sp {
  bool operator()(const string& left, const string& right) {
    return right < left;
  }
};
long long stoi(string& str) {
  istringstream second(str);
  long long i;
  second >> i;
  return i;
}
string itos(long long i) {
  stringstream second;
  second << i;
  return second.str();
}
long long numBits(long long n) {
  long long c = 0;
  while (n) {
    n &= (n - 1);
    c++;
  }
  return c;
}
int main() {
  int r, g, b;
  cin >> r >> g >> b;
  int a = min(r, g, b);
  int mx = 0;
  for (int i = 0; i <= min(a, 2); i++) {
    mx = max((r - i) / 3 + (g - i) / 3 + (b - i) / 3 + i, g / 3 + r / 3 + b / 3,
             mx);
  }
  cout << mx << endl;
  return 0;
}
