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.math.BigInteger;
import java.util.*;

public class Main {

    public static void main(String[] args) throws Exception{
        Scanner sc = new Scanner(System.in);
        int[] mas = new int[3];
        mas[0] = sc.nextInt();
        mas[1] = sc.nextInt();
        mas[2] = sc.nextInt();
        Arrays.sort(mas);
        int kol=mas[0];
        kol+= (mas[2]-kol)/3+(mas[1]-kol)/3;
        if(((mas[1]-mas[0])%3)==2 && ((mas[2]-mas[0])%3)==2 && mas[0]!=0)
        {
            
            kol++;
        }
        System.out.println(kol);
    }
}
