Counting A's in a Sequence

You are given a positive integer n representing the length of a sequence created during a game. Two players, with Kevin taking the first turn, play alternately. In the process, the letter 'A' is chosen by the starting player, and the rule ensures that the total number of 'A's in the final sequence is exactly $$\lceil \frac{n}{2} \rceil$$.

Your task is to compute and output the number of 'A's that will appear in the sequence.

For example, if n = 5, the answer is 3 because $$\lceil \frac{5}{2} \rceil = 3$$.

inputFormat

The input is read from standard input and consists of a single integer n (1 ≤ n ≤ 10⁹), representing the length of the sequence.

outputFormat

Output to standard output a single integer, which is the number of 'A's in the final sequence. This value is computed as $$\lceil \frac{n}{2} \rceil$$.

1

1