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.
s = raw_input()
lst = s.split(' ')
lst[0], lst[1], lst[2] = int(lst[0]), int(lst[1]), int(lst[2])
g_max = 0
path = [[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 1], [1, 0, 0], [1, 0, 1], [1, 1, 0], [1, 1, 1]]
for i in xrange(8):
	itm = path[i]
	a = lst[0] - itm[0] * 3
	b = lst[1] - itm[1] * 3
	c = lst[2] - itm[2] * 3
	if a < 0 or b < 0 or c < 0:
		continue
	g_max = max(g_max, a // 3 + b // 3 + c // 3 + min(a % 3 + itm[0] * 3, b % 3 + itm[1] * 3 , c % 3 + itm[2] * 3))
print g_max
