A Square Root Decomposition Problem with Large Constraints#12859

A Square Root Decomposition Problem with Large Constraints

4 seconds
1,024 megabytes
Medium

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.

Input

The first and only line contains one integer (1 \le n \le 10^{12}).

Output

Print one integer — the number of distinct values among n \bmod 1, n \bmod 2, , n \bmod n.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading

Example 3

Loading
Loading

Note

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.