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
input = sys.stdin.readline

'''

'''

r, g, b = map(int, input().split())

def brute(flowers):
    #print(flowers)
    if any(f==0 for f in flowers):
        return sum(f // 3 for f in flowers)

    a1 = 0
    init_flowers = flowers[::]

    if any(f >= 3 for f in flowers):
        for i in range(3):
            if flowers[i] >= 3:
                num = flowers[i] // 3
                flowers[i] -= num*3
                a1 += num
        a1 += brute(flowers)
    
    return max(a1, 1 + brute([f-1 for f in init_flowers]))

if r == 0 or g == 0 or b == 0:
    print(r//3 + g//3 + b//3)
else:
    min_flower = min(r, g, b)
    if min_flower <= 6:
        print(brute([r, g, b]))
    else:
        num = min_flower // 3 - 1
        
        r -= num*3
        g -= num*3
        b -= num*3
        #print(num*3*3)
        print(num*3 + brute([r, g, b]))

