Maximum Turns in a Coin Piles Game

You are given several piles of coins. In one turn, you can remove one coin from each pile that is not empty. The game ends when all piles are empty. Your task is to determine the maximum number of turns that can be made before all piles become empty. Note that in this problem, the maximum number of turns is simply equal to the number of piles, since each pile contributes exactly one turn regardless of the number of coins in it.

Note: If no pile is given, the answer is 0.

The answer should be computed based on reading the input from the standard input (stdin) and writing the result to the standard output (stdout).

inputFormat

The input is a single line containing space-separated positive integers. Each integer represents the number of coins in a pile. An empty input indicates that there are no piles.

outputFormat

Output a single integer — the maximum number of turns possible (i.e. the number of piles).

## sample

2 3 4

3

</p>