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.

s = raw_input()

s = s.split()

r = int(s[0])
g = int(s[1])
b = int(s[2])

n1 = 0
n2 = 0

n1 = r//3 + g//3 + b//3
r1 = r%3
g1 = g%3
b1 = b%3
n1 += min(r1,g1,b1)

n2 = min (r,g,b)
r2 = r-n2
g2 = g-n2
b2 = b-n2

n2 += r2 // 3 + g2 //3 + b2 //3

n3 = min(r,g,b) - 1
r3 = r-n3
g3 = g-n3
b3 = b-n3

if n3<0:
    n3 = 0
else:
    n3 += r3 // 3 + g3 //3 + b3 //3

#
#n4 = min(r,g,b) - 2
#r4 = r-n4
#g4 = g-n4
#b4 = b-n4
#
#n4 += r4 // 3 + g4 //3 + b4 //3


print max(n1,n2, n3)