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.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] info = sc.nextLine().split(" ");
        int[] flower = new int[3];
        for (int i = 0; i < 3; i++)
            flower[i] = Integer.parseInt(info[i]);
        sc.close();

        Arrays.sort(flower);
        long total = 0;
        if ((flower[1] - flower[0]) % 3 == 2
                && (flower[2] - flower[0]) % 3 == 2) {
            total += flower[1] / 3 + flower[2] / 3;
            flower[1] = flower[1] % 3;
            flower[2] = flower[2] % 3;
        }
        Arrays.sort(flower);
        total += flower[0] + (flower[1] - flower[0]) / 3
                + (flower[2] - flower[0]) / 3;
        System.out.println(total);
    }
}