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.
from collections import defaultdict
from bisect import bisect_right, bisect_left
import sys
sys.setrecursionlimit(10**8)
try: 
	FILE_POINTER = open('input.inpt')
	input = FILE_POINTER.readline
except: 
	FILE_POINTER = None
	input = sys.stdin.readline

r,g,b = list(map(int, input().strip().split()))
ans = r//3 + g//3 + b//3

r -= 1
g -= 1
b -= 1
if r>=0 and b>=0 and g>=0:
	ans = max(ans, 1 + r//3 + g//3 + b//3)

r -= 1
g -= 1
b -= 1
if r>=0 and b>=0 and g>=0:
	ans = max(ans, 2 + r//3 + g//3 + b//3)
print(ans)
if FILE_POINTER:
	FILE_POINTER.close()