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 CielFlowers322B
{
    public static void main(String[] args) 
    {
        // Set up scanner
        Scanner sc = new Scanner(System.in); 
        // System.out.println("Enter red");
        long r = sc.nextLong();
        // System.out.println("Enter blue");
        long b = sc.nextLong();
        // System.out.println("Enter green");
        long g = sc.nextLong();

        long modr = r%3;
        long modb = b%3;
        long modg = g%3;

        if ((modr == modb && modb == modg) || (modr != modg && modr!= modb && modg != modb))
        {
            long answer = 0;
            long numred = r/3;
            answer += numred;
            long newred = r%3;

            long numblue = b/3;
            answer += numblue;
            long newblue = b%3;

            long numgreen = g/3;
            answer += numgreen;
            long newgreen = g%3;

            answer += (Math.min(newred, Math.min(newblue, newgreen)));
            System.out.println(answer);
            return;
        }
        else    // If two are the same and one is different, I think it is this simple!  NOT IF ONE IS ZERO
        {
            long answer;
            if (r == 0)
            {
                answer = g/3 + b/3;
            }
            else if (g == 0)
            {
                answer = r/3 + b/3;
            }
            else if (b==0)
            {
                answer = r/3 + g/3;
            }
            else
            {
                answer = (r+g+b)/3;
            }
            System.out.println(answer);
        }
    }
}
        


        