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.
//package CF190;
import java.util.*;
public class problemB {
	public static void main(String[] args) {
		long[] flowers=new long[3];
		Scanner sc=new Scanner(System.in);
		flowers[0]=sc.nextLong();
		flowers[1]=sc.nextLong();
		flowers[2]=sc.nextLong();
		Arrays.sort(flowers);
		long a=flowers[0];
		long b=flowers[1];
		long c=flowers[2];
		long result=0;
		result+=(a);
		b-=(a);
		c-=(a);
		result+=(b/3)+(c/3);
		long r1=result;
		//System.out.println(result);
		a=flowers[0];
		b=flowers[1];
		c=flowers[2];
		result=0;
		result+=(b/3)+(c/3);
		b%=3;
		c%=3;
		flowers[0]=a;
		flowers[1]=b;
		flowers[2]=c;
		Arrays.sort(flowers);
		a=flowers[0];
		b=flowers[1];
		c=flowers[2];
		result+=(a);
		b-=(a);
		c-=(a);
		result+=(b/3)+(c/3);
//		System.out.println(result);
		long r2=result;
		if(r2>r1)
			System.out.println(r2);
		else
			System.out.println(r1);
	}

}
