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.
# i t n o A
# Python

r,g,b=map(int,raw_input().split())
R = r%3
G = g%3
B = b%3

red=0
green=0
blue=0

mixed=0

j=min(min(r,g),b)

db=[]

db.append((r/3)+(g/3)+(b/3)+min(min(R,G),B))
db.append((r-j)/3 + (g-j)/3 + (b-j)/3 + j)

if j>=1:
    db.append((r-j+1)/3 + (g-j+1)/3 + (b-j+1)/3 + j-1)
if j>=2:
    db.append((r-j+2)/3 + (g-j+2)/3 + (b-j+2)/3 + j-2)

db.sort()

print db[-1]
