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.
import sys
a,b,c=map(int,sys.stdin.readline().split())
res1=a//3+b//3+c//3
rem1=min(a%3,b%3,c%3)
res1=res1+rem1
res2=min(a,b,c)
rem2=(a-res2)//3+(b-res2)//3+(c-res2)//3
res2=res2+rem2
z=min(a,b,c)
if(z==a):
    s=b//3+c//3
    rem3=min(a,b%3,c%3)
    res3=s+rem3+(a-rem3)//3
    
elif(z==b):
    s=a//3+c//3
    rem3=min(a%3,b,c%3)
    res3=s+rem3+(b-rem3)//3

else:
    s=a//3+b//3
    rem3=min(a%3,b%3,c)
    res3=s+rem3+(c-rem3)//3

res=max(res1,res2,res3)
print(res)