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
import functools
sys.setrecursionlimit(100000)
r, g, b = [int(x) for x in sys.stdin.readline().strip().split()]

def permute(val,arr=[]):

	for i in val:
		for j in val:
			for k in val:
				if not (i>0 and j>0 and k>0):
					arr.append([i,j,k])
	return arr
m = 0
for i,j,k in permute([0,1,2]):
	if (r+g+b-i-j-k)%3==0 and (r-i)%3==(g-j)%3 and (r-i)%3==(b-k)%3 and r>=i and g>=j and b>=k:
		m = max(m,(r+g+b-i-j-k)//3)

print(m)
# print(m