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 static java.lang.System.in;
import static java.lang.System.out;

import java.io.*;
import java.util.*;

public class B332 {
	static final double EPS = 1e-10;
	static final double INF = 1 << 31;
	static final double PI = Math.PI;

	public static Scanner sc = new Scanner(in);
	StringBuilder sb = new StringBuilder();
	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

	public void run() throws IOException {
		String input;
		String[] inputArray;
		input = br.readLine();
		inputArray = input.split(" ");

		int x = Integer.valueOf(inputArray[0]);
		int y = Integer.valueOf(inputArray[1]);
		int z = Integer.valueOf(inputArray[2]);
		int a = x%3;
		int b = y%3;
		int c = z%3;
		int ans=0;
		int[][] table = new int[][] {{0,0,0,0,0,0,0,0,1},{0,0,0,0,1,1,0,1,1},{0,0,1,0,1,1,1,1,2}};
		ans = x/3 + y/3 + z/3 + table[a][3*b + c];
		if (a*b*c==0 && a+b+c==4 && x*y*z==0) ans--; 
		ln(ans);
	}

	public static void main(String[] args) throws IOException {
		new B332().run();
	}
	public static void ln(Object obj) {
		out.println(obj);
	}
}