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.
import sys
import math
import bisect
from math import sqrt
import random
def input():    return sys.stdin.readline().strip()
def iinput():   return int(input())
def rinput():   return map(int, sys.stdin.readline().strip().split()) 
def get_list(): return list(map(int, sys.stdin.readline().strip().split())) 
def rand():		return random.randint(0, 100)
mod = int(1e9)+7

def solve():
	r, g, b = rinput()
	if r>2 and g>2 and b>2:
		print(max(r//3 + g//3 + b//3, (r-1)//3 + (g-1)//3 + (b-1)//3 + 1, (r-2)//3 + (g-2)//3 + (b-2)//3 + 2))
	elif r>1 and g>1 and b>1:
		print(max(r//3 + g//3 + b//3, (r-1)//3 + (g-1)//3 + (b-1)//3 + 1))
	else:
		print(r//3 + g//3 + b//3)	


t = 1
# t = iinput()
for _ in range(t):
	solve()