Problem: Ivan has number . He is sorting through the numbers from to , and for every writes on blackboard. Here stands for least common multiple of and . Ivan is very lazy, that's why this task bored him soon. But he is interested in how many different numbers he would write on the board if he would finish the task. Help him to find the quantity of different numbers he would write on the board.
Input Format: The only line contains one integer — .
Output Format: Print one number — answer for the problem.
Note: In the first example , therefore is always equal to .
In the second example can be equal to or depending on parity of . can be equal to and .