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;


public class cielAndFlowers {
public static void main(String[] args) throws IOException {
	BufferedReader bfff=new BufferedReader(new InputStreamReader(System.in));
	String x=bfff.readLine();
	String [] y=x.split(" ");
	long r=Long.parseLong(y[0]);
	long b=Long.parseLong(y[1]);
	long g=Long.parseLong(y[2]);
	int total=0;
	boolean flag=true;
	if((r==0)||(g==0)||(b==0))
		flag=false;
	total+=(r/3);
	total+=(b/3);
	total+=(g/3);
	r=r%3;
	b=b%3;
	g=g%3;
	while((r>=1)&&(b>=1)&&(g>=1))
	{
		total++;
		r-=1;
		b-=1;
		g-=1;
	}
	if((((r==2)&&(b==2)&&(g==0))||((r==0)&&(b==2)&&(g==2))||((r==2)&&(b==0)&&(g==2)))&&(flag))
	{
		total+=1;
	}
	System.out.println(total);
}
}
