Let us denote the greatest integer less than or equal to x by [x]. For a given integer n, determine the number of distinct integers in sequence.

[ 1² ÷ n ], [ 2² ÷ n ], ..... , [ n² ÷ n ]

Input

Each line contains a single integer n (1 <= n < 10^18). Input is terminated by -1 (Don't process it). There are around 10^5 lines.

Output

For each test case, output the required answer on separate line.

Example

Input:
5
10
-1
Output:
4
8