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.
def main():
    flowers = list(map(int,input().split()))
    ways = []
    for i in range(2**3):
        s = bin(i)[2:]
        if len(s) < 3:
            s = '0'*(3-len(s))+s
        ways.append(s)

    max_ans = 0
    for way in ways:
        ans = 0
        new = []
        for i in range(3):
            if way[i] == '1':
                ans += flowers[i]//3
                new.append(flowers[i]%3)
            else:
                new.append(flowers[i])
        ans += min(new)
        val = min(new)
        for i in range(3):
            new[i] -= val
            ans += new[i]//3
        max_ans = max(max_ans,ans)

    print(max_ans)

main()
