For this Question: 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 A<sub>i</sub> (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.The first line of the input contains a single integer N.

Constraints:
1 <= N <= 10<sup>18</sup>Print the number of odd numbers that are present in the array after performing all the operations.Sample Input:
4

Sample Output:
2, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long
 
signed main(){
    int n;
    cin >> n;
    int ans = n - (int)sqrtl(n);
    cout << ans;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?