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 CeilFlowers {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int red = sc.nextInt();
        int green = sc.nextInt();
        int blue = sc.nextInt();
        int count = 0;
        boolean onezero = false;
        if(red==0 || green==0|| blue==0)onezero=true;
        count += Math.min(red,Math.min(green,blue));
        red = red - count;
        green = green - count;
        blue = blue - count;
        count += red/3 + green/3 + blue/3;
        red = red%3;
        green = green%3;
        blue = blue%3;
        if(red+green+blue==4 && !onezero)count++;
        
        System.out.println(count);

        // solve();
        sc.close();
    }
    // public static void solve(){
        
    // }
}