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.*;

 
public class BruteForce{
    
    public static Scanner in=new Scanner(System.in);
    public static int getX(int r,int g,int b){
        int min=Math.min(r,g);
        min=Math.min(b,min);
        return min;
    }
    public static long solve(int r,int g,int b){
        long max=0;
        {
            //XRGB
            long cur=0;
            
            int r1=r;
            int g1=g;
            int b1=b;
            
             int x=getX(r1,g1,b1);
            r1-=x;g1-=x;b1-=x;
            cur+=x;
             cur+=g1/3;
            g1=g1%3;
            cur+=r1/3;
            r1=r1%3;
             cur+=b1/3;
            b1=b1%3;
            max=Math.max(cur,max);
        }
        
        {
            //RXGB
            long cur=0;
            
            int r1=r;
            int g1=g;
            int b1=b;
            
            cur+=r1/3;
            r1=r1%3;
            int x=getX(r1,g1,b1);
            r1-=x;g1-=x;b1-=x;
            cur+=x;
            cur+=g1/3;
            g1=g1%3;
            cur+=b1/3;
            b1=b1%3;
            max=Math.max(cur,max);
            
        }
        {
            //GXRB
            long cur=0;
            
            int r1=r;
            int g1=g;
            int b1=b;
            
            cur+=g1/3;
            g1=g1%3;
            int x=getX(r1,g1,b1);
            r1-=x;g1-=x;b1-=x;
            cur+=x;
            cur+=r1/3;
            r1=r1%3;
            cur+=b1/3;
            b1=b1%3;
            max=Math.max(cur,max);
        }
        {
            //BXRG
            long cur=0;
            
            int r1=r;
            int g1=g;
            int b1=b;
            
            cur+=b1/3;
            b1=b1%3;
            int x=getX(r1,g1,b1);
            r1-=x;g1-=x;b1-=x;
            cur+=x;
            cur+=r1/3;
            r1=r1%3;
            cur+=g1/3;
            g1=g1%3;
            max=Math.max(cur,max);
        }
        {
            //BGXR
            long cur=0;
            
            int r1=r;
            int g1=g;
            int b1=b;
            
            cur+=b1/3;
            b1=b1%3;
            cur+=g1/3;
            g1=g1%3;
             int x=getX(r1,g1,b1);
            r1-=x;g1-=x;b1-=x;
            cur+=x;
            cur+=r1/3;
            r1=r1%3;
            max=Math.max(cur,max);
        }
        {
            //BRXG
            long cur=0;
            
            int r1=r;
            int g1=g;
            int b1=b;
            
            cur+=b1/3;
            b1=b1%3;
            cur+=r1/3;
            r1=r1%3;
             int x=getX(r1,g1,b1);
            r1-=x;g1-=x;b1-=x;
            cur+=x;
            cur+=g1/3;
            g1=g1%3;
            max=Math.max(cur,max);
        }
        {
            //GRXB
            long cur=0;
            
            int r1=r;
            int g1=g;
            int b1=b;
            
            cur+=g1/3;
            g1=g1%3;
            cur+=r1/3;
            r1=r1%3;
             int x=getX(r1,g1,b1);
            r1-=x;g1-=x;b1-=x;
            cur+=x;
            cur+=b1/3;
            b1=b1%3;
            max=Math.max(cur,max);
        }
        {
            //RGBX
            long cur=0;
            
            int r1=r;
            int g1=g;
            int b1=b;
            
             cur+=g1/3;
            g1=g1%3;
            cur+=r1/3;
            r1=r1%3;
             cur+=b1/3;
            b1=b1%3;
             int x=getX(r1,g1,b1);
            r1-=x;g1-=x;b1-=x;
            cur+=x;
            max=Math.max(cur,max);
        }
        return max;
    }
    public static void main(String[]args){
        int r=in.nextInt();
        int g=in.nextInt();
        int b=in.nextInt();
        
        long ans=solve(r,g,b);
        System.out.println(ans);
    }
}