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;
bool comp(pair<long long int, long long int> a,
          pair<long long int, long long int> b) {
  if (a.first == b.first) {
    if (a.second <= b.second)
      return true;
    else
      return false;
  }
  if (a.first > b.first)
    return true;
  else
    return false;
}
void solve() {
  long long int r, b, g;
  cin >> r >> b >> g;
  long long int ans = 0;
  ans += r / 3 + b / 3 + g / 3;
  ans += min({r % 3, b % 3, g % 3});
  b--;
  r--;
  g--;
  ans = max(ans, 1 + r / 3 + b / 3 + g / 3 + min({r % 3, b % 3, g % 3}));
  b--;
  r--;
  g--;
  ans = max(ans, 2 + r / 3 + b / 3 + g / 3 + min({r % 3, b % 3, g % 3}));
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}
