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.
r, g, b = [int(i) for i in raw_input().strip().split()]

t = 0
if r > 3:
    if r % 3 == 0:
        t += ((r/3) - 1)
        r -= 3*((r/3) - 1)
    else:
        t += r/3
        r -= 3*(r/3)

if g > 3:
    if g % 3 == 0:
        t += ((g/3) - 1)
        g -= 3*((g/3) - 1)
    else:
        t += g/3
        g -= 3*(g/3)

if b > 3: 
    if b % 3 == 0:
        t += ((b/3) - 1)
        b -= 3*((b/3) - 1)
    else:
        t += b/3
        b -= 3*(b/3)

if [r, g, b].count(3) <= 1:
    m = min(r, g, b)
    t += m
    r -= m
    g -= m
    b -= m
t += [r, g, b].count(3)

print t
