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.
# Author: Sachin Jain
# Problem: http://codeforces.com/problemset/problem/322/B

def buildMixingBucketsFirst(num_red, num_green, num_blue):
  mixing_buckets = min(num_red, num_green, num_blue)
  num_red     -= mixing_buckets
  num_green   -= mixing_buckets
  num_blue    -= mixing_buckets

  individialBuckets = num_red/3 + num_green/3 + num_blue/3
  remainingFlowers = num_red%3 + num_green%3 + num_blue%3

  if (remainingFlowers == 4 and mixing_buckets):
    individialBuckets += 2
    mixing_buckets -= 1

  return individialBuckets + mixing_buckets

def main():
  num_red, num_green, num_blue = raw_input().split()
  num_red   = int(num_red)
  num_green = int(num_green)
  num_blue  = int(num_blue)

  result = buildMixingBucketsFirst(num_red, num_green, num_blue)
  print(result)

main()