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 java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Main{
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
	
		
		StringTokenizer st= new StringTokenizer(bf.readLine());
		int min=1000000001;
		int x= Integer.parseInt(st.nextToken());
		if (x<min)
		min=x;
		int y= Integer.parseInt(st.nextToken());
		if (y<min)
			min=y;
		int z= Integer.parseInt(st.nextToken());
		if (z<min)
			min=z;
		
		int x1=x;
		int y1=y;
		int z1=z;
		
		

		long res=0;
		res+= min;
		x-=min;
		y-=min;
		z-=min;
		
		boolean flag = (res!=0);
		
		res+=(x/3)+(y/3)+(z/3);

		int count=0;
		if (x1>2 && x%3==2){
			count++;
		}
		if (y1>2  && y%3==2){
			count++;
		}
		if (z1>2 && z%3==2){
			count++;
		}
		if (count==2 & flag)
			res+=1;
		
		System.out.println(res);

	
	
}
}
