#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
 
int main() {
  int N;
  cin >> N;
  cout << (N + (100 - 1)) / 100 << endl;
  
  return 0;
}
#include <iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<math.h>
#include<iomanip>
#include<string>
#include <cassert>
#include <complex>
#include<math.h>
#include<bits/stdc++.h>

#define rep(s,i,n) for(int i = s;i < n;i++)
 
using namespace std;
 
typedef long long ll; //10e18くらい
typedef long double ld;
typedef __int128_t lll;
typedef pair<ll, ll> pll;
 
const int dx[] = { 0,1,0,-1 };
const int dy[] = { 1,0,-1,0 };
const ll LongINF = 1e13 + 7;
const int INF = 1e9 + 7;
const ll LL_MAX = 9223372036854775807;
const ll LL_MIN = -9223372036854775807;


int dsp[3] = {-1,0,1};

int keta(ll i){

  int keta = 0;
  do{
    keta++;
  }while(i /= 10);

  return keta;
}
//素因数分解　O(√n)
vector<pair<ll,ll>> pfactor(ll n){
  vector<pair<ll,ll>> factor;
   ll ex; //指数
   for(ll a = 2; a * a <= n; a++){
     if(n % a != 0)continue;

     ll ex = 0;

     while(n % a == 0){
       n /= a;
       ex++;
     }

     factor.push_back({a,ex});
   }

   if(n != 1) factor.push_back({n,1});

  return factor; 
}




 
int main(void){

  ll n;
  cin >> n;
  set<ll> s;

  for(ll a = 2; a*a <= n;a++){
    ll x = a * a;
    while(x <= n){
      s.insert(x);
      x *= a;
    }
  }
  cout << n-s.size();


  return 0;
}