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.
# coding: utf-8

def mixBouquets(parada, lista):
	mix, bouquet = 0, 0

	i = 0
	while True:
		if i > parada: break

		if lista[0] > 1 and lista[1] > 1 and lista[2] > 1:
			mix += 1
			lista[0] -= 1
			lista[1] -= 1
			lista[2] -= 1
		else:
			break

		i += 1

	for k in xrange(3):
		if lista[k] >= 3:
			bouquet += lista[k] / 3
			lista[k] %= 3

	# verificando os restos
	if not 0 in lista:
		i = 0

		while True:
			if lista[0] > 0 and lista[1] > 0 and lista[2] > 0:
				mix += 1
				lista[0] -= 1
				lista[1] -= 1
				lista[2] -= 1
			else:
				break

	bouquet += mix
	return bouquet

########

cores = map(int, raw_input().split())

if cores[0] == cores[1] == cores[2]:
	bouquet = cores[0]

elif cores[0] % 3 == cores[1] % 3 == cores[2] % 3 == 0:
	bouquet = (cores[0] / 3) + (cores[1] / 3) + (cores[2] / 3)

else:
	aux = []

	for i in xrange(3):
		aux.append(cores[i])	# aux agora é uma cópia de cores

	bq1 = mixBouquets(1, cores)
	bq2 = mixBouquets(2, aux)

	if bq1 > bq2:	bouquet = bq1
	else:			bouquet = bq2

print bouquet