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.
def mixed_f(listt):
	mixed = listt[0]
	res = 0
	for i in xrange(3):
		if flowers[i]-mixed >= 3: 
			res += ((flowers[i]-mixed) / 3)
	return res + mixed

def more_f(listt):
	summ = 0
	mixed = 0
	rest = [listt[0]]
	for i in xrange(2, 0, -1):
		summ += flowers[i] / 3
		rest.append(flowers[i] % 3)
		
	rest.sort()
	summ += mixed_f_alt(rest)
	return summ

def at_least(listt):
	if (listt[0] == 0) and (listt[1] < 3) and (listt[2] < 3): return False
	elif (listt[1] == 0) and (listt[0] < 3) and (listt[2] < 3): return False
	elif (listt[2] == 0) and (listt[1] < 3) and (listt[0] < 3): return False
	else: return True

def no_zeros(listt):
	return not (0 in listt)

def mixed_f_alt(listt):
	minn = min(listt)
	return minn+((listt[-1]-minn)/3)

flowers = map(int, raw_input().split())
flowers.sort()

if (sum(flowers) >= 3) and (at_least(flowers)):
	parc = mixed_f(flowers)
	summ = more_f(flowers)
	print max(parc, summ)
else: print 0
