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.
flores = map(int, raw_input().split(' '))

flag = False

if (flores[0] == 0 or flores[1] == 0 or flores[2] == 0):
  flag = True

a = flores[0]/3
b = flores[1]/3
c = flores[2]/3

soma = a + b + c

ar = flores[0]%3
br = flores[1]%3
cr = flores[2]%3

if (ar + br + cr == 6):
  soma += 2
elif (((ar + br + cr > 3 and ar + br + cr < 6) or (ar == 1 and br == 1 and cr == 1)) and (flag != True) ):
  soma += 1

print soma
