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.
inStr = input()
r=int(inStr.split()[0])
g=int(inStr.split()[1])
b=int(inStr.split()[2])

minimum = min(r, g, b)
l = [r, g, b]
mult = 1 if minimum>0 else 0
upd = [(x-minimum) // 3 + 1*mult if ((x-minimum) % 3)>=2 and x > 3 else 0 for x in l]
ans = sum(upd)
updated = [x[0]-x[1]*3 for x in zip(l, upd)]
min_upd = min(updated)
ans = ans + min_upd
updated = [x-min_upd for x in updated]
for e in updated:
    ans = ans + e // 3

print(ans)