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;

/**
 *
 * @author ahassan
 */
public class JavaApplication1 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long re = 0, r = 0, g, b;
        r = sc.nextLong();
        g = sc.nextLong();
        b = sc.nextLong();
        boolean ch = false;
        if (r == 0 || b == 0 || g == 0) {
            ch = true;
        }
        re += Math.min(r, Math.min(g, b));
        r -= re;
        g -= re;
        b -= re;

        if (r >= 3) {
            //while (r >= 3) {
            re += r / 3;
            r = r % 3;
            // }
        }
        if (g >= 3) {
            //while (g >= 3) {
            re += g / 3;
            g = g % 3;
            //}
        }
        if (b >= 3) {
            //while (b >= 3) {
            re += b / 3;
            b = b % 3;
            //}
        }

        long sum = r + b + g;

        if (sum == 4) {
            if (ch == false ) {
                re += 1;
            }
        }

        System.out.println(re);

    }

}
