#C674. Mystery Sequence Distinct Count
Mystery Sequence Distinct Count
Mystery Sequence Distinct Count
Given a positive integer \(N\), define a sequence \(a(i)\) for \(1 \leq i \leq N\) as follows:
\[ a(i) = \begin{cases} 2i, & \text{if } i \text{ is odd}\\ \frac{i}{2}, & \text{if } i \text{ is even} \end{cases} \]
Your task is to compute the number of distinct integers present in this sequence.
inputFormat
The input consists of a single line containing one integer \(N\) (\(1 \leq N \leq 10^6\)).
outputFormat
Output a single integer representing the number of distinct values in the generated sequence.
## sample5
4
</p>