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.
vermelho, verde, azul = map(int,raw_input().split())
soma = 0
sobra = True

if vermelho != 0 and verde != 0 and azul != 0:

	menor = min(vermelho, verde, azul)
	resto = max(vermelho % menor, verde % menor, azul % menor)
	soma = 0
	soma += resto
	soma += (vermelho - resto)/3 + (verde - resto)/3 + (azul - resto)/3
	 
somaR = vermelho / 3
somaG = verde / 3
somaB = azul / 3
 
rr = vermelho % 3
rg = verde % 3
rb = azul % 3

if rr == 0 and rg == 0 and rb == 0:
	
	print max(somaR + somaG + somaB, soma, somaR + somaG + somaB + min(rr,rg,rb))
	
elif rr == 0 or rg == 0 or rb == 0:
	
	print max(min(vermelho, verde, azul), soma, somaR + somaG + somaB + min(rr,rg,rb))	
else:	

	soma = somaR + somaG + somaB + min(rr,rg,rb)

	print soma
