#00012E

Wooden doors

Little-Z has N closed wooden doors (numbered from 1 to N), and N people.


The first man opens every door. So then, all doors are in opened state. The second man changes the state (opens, if closed and closes, if opened) of every second door. The third man changes the state of every third door, the fourth man changes the state of every fourth door and so on...


At the end, when all people do their pass, some of the doors remain opened.


Since this task is very time-consuming to do it in real time, they gave you you a computer to predict a number of opened doors.


InputIn first line, there will be a number 1 <= N <= 2^60, representing the number of people and doors. For first 5 test cases it wil be true: 1 <= N <= 2^30.

OutputOutput one number, representing the number of opened doors after all N people have done their pass on N wooden doors.

Input:
10

Output:
3

Submit solution

Coming later

The grading service will be connected in a later migration step. You can inspect the task and your previous results now.