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.
x = list(map(int, input().split(" ")))
bq = 0
x.sort()
if x[0] >= 3:
    if x[0] % 3 == 0 and x[2] != 0 and x[1] != 0:
        bq += x[0] // 3 - 1
        x[0] = 3
    else:
        bq += x[0] // 3
        x[0] = x[0] % 3
if x[1] >= 3:
    if x[1] % 3 == 0 and x[0] != 0 and x[2] != 0:
        bq += x[1] // 3 - 1
        x[1] = 3
    else:
        bq += x[1] // 3
        x[1] = x[1] % 3

if x[2] >= 3:
    if x[2] % 3 == 0 and x[0] != 0 and x[1] != 0:
        bq += x[2] // 3 - 1
        x[2] = 3
    else:
        bq += x[2] // 3
        x[2] = x[2] % 3
x.sort()
t1,t2=0,0
if x[0] <= 3:
    t1 = x[0]
if x[1]==3 and x[2]==3:
    t2 = 2
print(bq+max(t1,t2))