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.
import sys

a, b, c = [int(x) for x in sys.stdin.readline().split()]
n1 = (1 if a % 3 == 0 else 0) + (1 if b % 3 == 0 else 0) + (1 if c % 3 == 0 else 0)
n2 = (1 if (a-1) % 3 == 0 else 0) + (1 if (b-1) % 3 == 0 else 0) + (1 if (c-1) % 3 == 0 else 0)
n3 = (1 if (a-2) % 3 == 0 else 0) + (1 if (b-2) % 3 == 0 else 0) + (1 if (c-2) % 3 == 0 else 0)
best = max(n1, n2, n3)
answer = 0
if best == n1:
    answer += a/3 + b/3 + c/3
elif best == n2 and min(a, b, c) >= 1:
    answer += 1 + (a-1)/3 + (b-1)/3 + (c-1)/3
elif best == n3 and min(a, b, c) >= 2:
    answer += 2 + (a-2)/3 + (b-2)/3 + (c-2)/3
else:
    answer += a/3 + b/3 + c/3
print(answer)
