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.
#B. Ciel and Flowers
#Codeforces Round #190 (Div. 2)
import math
def get_res(r1, g1, b1):
    r = r1
    g = g1
    b = b1
    result = r / 3 + g / 3 + b / 3
    r = r%3
    g = g%3
    b = b%3
    s = min (r, g, b)
    result += s
    r -= s
    g -= s
    b -= s
    if r*g == 4:
        if b1 > 2:
            result += 1
    elif g*b == 4:
        if r1 > 2:
            result += 1
    elif b*r == 4:
        if g1 > 2:
            result += 1
    else:
        result += 0
    return result

#N = int(raw_input())  

r, g, b = [int(s) for s in raw_input().split(" ")]
result = get_res(r, g, b)
print "{}".format(result)
