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.
ra, ga, ba = map(int, raw_input().split())


r, g, b = ra % 3, ga % 3, ba % 3
if r == 0 and ra >= 3:
    r += 3
if g == 0 and ga >= 3:
    g += 3
if b == 0 and ba >= 3:
    b += 3

result = 0
result += (ra - r) / 3
result += (ga - g) / 3
result += (ba - b) / 3

cache = {}
def calc(r, g, b):
    if (r, g, b) in cache:
        return cache[(r, g, b)]

    if r < 0 or g < 0 or b < 0:
        cache[(r, g, b)] = 0
        return cache[(r, g, b)]

    if r == 0 or g == 0 or b == 0:
        cache[(r, g, b)] = (r / 3) + (g / 3) + (b / 3)
        return cache[(r, g, b)]

    if r == g == b:
        cache[(r, g, b)] = r
        return cache[(r, g, b)]

    cache[(r, g, b)] = 1 + max(
        calc(r-3, g, b),
        calc(r, g-3, b),
        calc(r, g, b-3),
        calc(r-1, g-1, b-1)
    )
    return cache[(r, g, b)]


print result + calc(r, g, b)
