Max Projects

You are given three integers representing the quantities of red, green, and blue paints respectively. Each project requires one unit of each paint. The maximum number of projects that can be completed is determined by the number of complete sets of paints available, i.e. the minimum of R, G, and B. Formally, the answer is given by \(\min(R, G, B)\).

Determine the maximum number of projects that can be completed based on the available paint counts.

inputFormat

The input is read from standard input (stdin). A single line contains three space-separated integers (R), (G), and (B) representing the quantity of red, green, and blue paints respectively.

outputFormat

Output the maximum number of projects that can be completed, which is the minimum of (R), (G), and (B). The result should be printed to standard output (stdout).## sample

3 3 3

3