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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;


public class Round190Div2 {
	
	public static void main(String[] args) throws IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String l = br.readLine();
		String[] parts = l.split(" ");
		int r = Integer.parseInt(parts[0]);
		int g = Integer.parseInt(parts[1]);
		int b = Integer.parseInt(parts[2]);
		
		int steps = 0; 
		
		if(r>3) {
			steps += ((r-1)/3);
			r = r - (((r-1)/3)*3);
		}
		
		if(g>3) {
			steps += ((g-1)/3);
			g = g - (((g-1)/3)*3);
		}
		
		if(b>3) {
			steps += ((b-1)/3);
			b = b - (((b-1)/3)*3);
		}
		
		//System.out.println(r+","+g+","+b);
		int threes = 0;
		if(r==3) {
			threes++;
		}
		if(g==3) {
			threes++;
		}
		if(b==3) {
			threes++;
		}
		if(threes>=2) {
			System.out.println(steps+threes);
		}
		else {
			

			int min = Math.min(Math.min(r,g), b);
			steps += min;
			r -= min;
			b -= min;
			g -= min;
			steps += (r/3);
			steps += (g/3);
			steps += (b/3);
			
			System.out.println(steps);
		}
		
		
		
		
		
		
		
		
	}
}
/*
139978911 5123031 935395222
360165721
*/