#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
#define u unsigned
#define endl '\n'
#define mod 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
 
 
void solve(){
   ll n;
   cin>>n;
   unordered_set<ll> s;
   for(ll a=2;a*a<=n;a++){
       ll val = a*a;
       while(val<=n){
           s.insert(val);
           val*=a;
       }
   }
   cout<<n - s.size()<<endl;
}
  
  
int main() {
  
  quick;
  int t=1;
//   cin>>t;
  
  while(t--){
    
      solve();    
  }
 
 
}
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define up upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

indexed_set s;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	ll p=2;
	while (p<40){
		ll b=2;
		while (true){
			ll curr=1;
			rep(x,0,p){
				curr*=b;
				if (curr>1e10) goto die;
			}
			s.insert(curr);
			b++;
		}
		die:;
		p++;
	}
	
	ll n;
	cin>>n;
	cout<<n-s.order_of_key(n+1)<<endl;
}
