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.
#!/usr/bin/env python
# -*- coding:utf-8 -*-

import sys
line = sys.stdin.readline().split(" ")
r, g, b = ([int(n) for n in line])
minn = min(r, g, b)

ans0 = 0; ans1 = 0; ans2 = 0
ans0 = r // 3 + g // 3 + b // 3

if minn > 1:
    r1, g1, b1 = ([r-1, g-1, b-1])
    ans1 = 1 + r1 // 3 + g1 // 3 + b1 // 3

if minn > 2:
    r2, g2, b2 = ([r-2, g-2, b-2])
    ans2 = 2 + r2 // 3 + g2 // 3 + b2 // 3

ans = max([ans0, ans1, ans2])

print ans
