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 sys import stdin

rints = lambda: [int(x) for x in stdin.readline().split()]
a = rints()
mod = [a[0] % 3, a[1] % 3, a[2] % 3]
# print(mod)

if mod[0] == mod[1] == mod[2]:
    print(mod[0] + a[0] // 3 + a[1] // 3 + a[2] // 3)

elif mod[0] != mod[1] and mod[0] != mod[2] and mod[1] != mod[2]:
    print(a[0] // 3 + a[1] // 3 + a[2] // 3)

else:

    arr = sorted(map(lambda x, y: [x, y], a, mod), key=lambda x: x[1])

    if arr[1][1] == arr[2][1]:
        arr = arr[1:] + [arr[0]]

    if arr[0][1] in [0, 1]:
        org = arr[2][0]
        arr[2][0] -= min(arr[0][1], arr[2][0])

        print(arr[0][0] // 3 + arr[1][0] // 3 + arr[2][0] // 3 + min(arr[0][1], org))

    else:
        org = arr[-1][0]
        for i in range(3):
            arr[i][0] -= min(2, arr[-1][0])

        print(arr[0][0] // 3 + arr[1][0] // 3 + arr[2][0] // 3 + min(2, org))
