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.*;
import java.util.*;
public class j
{
static int check(int x,int y,int z)
{
int k=0;
if(x%3==0)
k++;
if(y%3==0)
k++;
if(z%3==0)
k++;
return(k);
}
public static void main(String aa[])throws IOException
{
BufferedReader b=new BufferedReader(new InputStreamReader(System.in));
int l=0,n=0,m=0,p=0,t=0;
String s;
s=b.readLine();
StringTokenizer c=new StringTokenizer(s);
n=Integer.parseInt(c.nextToken());
m=Integer.parseInt(c.nextToken());
p=Integer.parseInt(c.nextToken());
if(m!=0&&n!=0&&p!=0)
{
t=check(n,m,p);
if(t==1)
{
if(n%3==2)
l++;
if(m%3==2)
l++;
if(p%3==2)
l++;
if(l==2)
System.out.print(n/3+m/3+p/3+1);
else
System.out.print(n/3+m/3+p/3);
System.exit(0);
}
t=(int)Math.min(Math.min(n%3,m%3),p%3);
System.out.print(n/3+m/3+p/3+t);
}
else
System.out.print(n/3+m/3+p/3);
}
}