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 {
        cielAndFLowers();
    }
//    public static void cielAndFlowers()throws IOException{
//        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
//        String[] input=reader.readLine().split(" ");
//        long[] flower=new long[3];
//        int i;
//        for(i=0;i<3;i++){
//            flower[i]=Long.parseLong(input[i]);
//        }
//        Arrays.sort(flower);
//        long min=flower[0];
//        if(min==0){
//            System.out.println(flower[1]/3+flower[2]/3);
//            return;
//        }
//        int cnt1=0;
//        int cnt2=0;
//        long[] rem=new long[3];
//        for(i=0;i<3;i++){
//            rem[i]=flower[i]%3;
//            if(rem[i]==1){
//                cnt1++;
//            }
//            else if(rem[i]==2){
//                cnt2++;
//            }
//        }
//        if(cnt1==0&&cnt2==0||(cnt1==0&&cnt2==1)||(cnt1==1&&cnt2==0)){
//            System.out.println(Math.max(min,(flower[0]/3+flower[1]/3+flower[2]/3)));
//        }
//        else if(cnt1>1||(cnt1==1&&cnt2==1)){
//            for(i=0;i<3;i++){
//                flower[i]--;
//            }
//            System.out.println(Math.max(min,(flower[0]/3+flower[1]/3+flower[2]/3+1)));
//        }
//        else if(cnt2>1){
//            for(i=0;i<3;i++){
//                flower[i]-=2;
//            }
//            System.out.println(Math.max(min,(flower[0]/3+flower[1]/3+flower[2]/3+2)));
//        }
//    }

    public static void cielAndFLowers()throws IOException{
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        String[] input=reader.readLine().split(" ");
        long r,g,b;
        r=Long.parseLong(input[0]);
        g=Long.parseLong(input[1]);
        b=Long.parseLong(input[2]);
        long b3,min=Math.min(r,Math.min(g,b));
        b3=r/3+g/3+b/3;
        if(min==0){
            System.out.println(b3);
        }
        else {
            long b1,b2;
            b1=(r-1)/3+(g-1)/3+(b-1)/3+1;
            b2=(r-2)/3+(g-2)/3+(b-2)/3+2;
            System.out.println(Math.max(Math.max(b3,min),Math.max(b1,b2)));
        }
    }
}
