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.
a, b, c = map(int, raw_input().split())
x, y, z = a, b, c;

bouquets = a/3 + b/3 + c/3
a = a%3
b = b%3
c = c%3


for i in range(2):
  if a >= 1 and b >= 1 and c >= 1:
    bouquets += 1
    a -= 1
    b -= 1
    c -= 1

if ((a+b) == 4 and z >= 3)or ((b+c) == 4 and x >=3) or ((a+c) == 4 and y >=3):
  bouquets += 1;
  
print bouquets