Question
Counting Odd Numbers
You are given an integer N. You create an array A of the first N odd numbers i. e. A = {1, 3,. , 2*N - 1}. Now, for each i from 1 to N, you increase the element Ai (assuming 1- based indexing) by X where X is the number of elements between 1 to N that completely divide i.
After performing all these steps, find the number of odd numbers that are present in the array.
After performing all these steps, find the number of odd numbers that are present in the array.
Input
The first line of the input contains a single integer N.
Constraints:
1 <= N <= 1018
Constraints:
1 <= N <= 1018
Output
Print the number of odd numbers that are present in the array after performing all the operations.
Example
Sample Input:
4
Sample Output:
2
4
Sample Output:
2