You are given a positive integer . Find how many distinct values there are among the numbers n \bmod 1, n \bmod 2, , n \bmod n.
The first and only line contains one integer (1 \le n \le 10^{12}).
Print one integer — the number of distinct values among n \bmod 1, n \bmod 2, , n \bmod n.
Example 1
Example 2
Example 3
In the first sample we consider only one value: 1 \bmod 1 = 0, so the answer is .
In the second sample we have 2 \bmod 1 = 2 \bmod 2 = 0, so the answer is again .
In the third sample we have 3 \bmod 1 = 3 \bmod 3 = 0, and also 3 \bmod 2 = 1, which gives two distinct values in total.