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.util.*;
/**
 *
 * @author Dhruv
 */
public class CODING {
    public static void main(String[] args) {
        int flower[]={0,0,0};
        int c=0,t=0;
        Scanner sc=new Scanner(System.in);
        flower[0]=sc.nextInt();
        flower[1]=sc.nextInt();
        flower[2]=sc.nextInt();
        int min=flower[0];
        for(int i=0;i<3;i++)
        {
        	int x=flower[i];
			if(x%3==0&&x>0)
			{
				c=c+(flower[i]/3)-1;
				flower[i]=3;
				t++;
			}
			else if(x%3==1)
			{
				c=c+(flower[i]/3);
				flower[i]=1;
			}
			else if(x%3==2)
			{
				c=c+(flower[i]/3);
				flower[i]=2;
			}
			if(x==0)
			c=c+t;
			if(min>flower[i])
			min=flower[i];
        }
        if(t==2&&min==1)
        c=c+t-1;
        else if(t==2&&min==0)
        c=c+t;
        System.out.println(c+min);
    }
}