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=map(int,raw_input().split())
sum=0
dr=R%3
dg=G%3
db=B%3
dc=[]
dc.append(dr)
dc.append(dg)
dc.append(db)
if (dr==2 and dg==2 and db==0 and B<>0) or (dr==0 and dg==2 and db==2 and R<>0) or (dr==2 and dg==0 and db==2 and G<>0):
  sum+=1
sum+=R/3+B/3+G/3+min(dc)
print  sum