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.

t=list(map(int,input().split()))
o,c=[],[]

for i in range(3):
    o.append(t[i]%3)
    c.append(t[i]//3)

if(o[0]>o[1]):
    (o[1],o[0])=(o[0],o[1])
    (c[1],c[0])=(c[0],c[1])
if(o[1]>o[2]):
    (o[1],o[2])=(o[2],o[1])
    (c[1],c[2])=(c[2],c[1])
if(o[0]>o[1]):
    (o[1],o[0])=(o[0],o[1])
    (c[1],c[0])=(c[0],c[1])
    
cs=(t[0]+t[1]+t[2])//3
if((o[0]==0 and o[1]==1 and o[2]==2) or (c[0]+o[0]==0 and o[1]==2 and o[2]==2)):
    cs-=1

print(cs)