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.
from sys import stdin,stdout
from collections import Counter
nmbr=lambda:int(stdin.readline())
lst = lambda: list(map(int,stdin.readline().split()))
def fn(useda):
    ans=useda+(a-useda)//3
    cb=(b-useda)//3
    cc=(c-useda)//3
    return ans+cb+cc

for _ in range(1):#nmbr()):
    a,b,c=sorted(lst())
    nearmulof3forb=(b//3)*3
    nearmulof3forc=(c//3)*3
    useda=b-nearmulof3forb
    ans=fn(min(useda,a))
    useda=c-nearmulof3forc
    ans=max(ans,min(useda,a),fn(a),a//3+b//3+c//3)
    print(ans)
    # for i in range(a+1):
    #     print(i,fn(i))