#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mod 1000000007
#define rep(i,n) for(int i=0; i<n; i++)
#define repa(i,start,end) for(int i=start; i<=end; i++)
#define repd(i,start,end) for(int i=start; i>=end; i--)
#define all(x) x.begin(),x.end()
#define debug(x) cout << "(" << #x << ": " << x << ")" << endl;

void solve() {
    int x;
    cin >> x;
    cout << 100 - (x%100) << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
using ll = long long;


int main(){
    ll n;
    cin >> n;
    ll rtn = sqrt(n);
    set<ll> is;
    ll sum = 1;//1 is include
    for(ll i = 2; i*i <= n; i++){
        ll cnt = 0;
        ll j = i;
        while(j*i <= n){
            j *= i;
            cnt++;
            if(is.count(j)) cnt--;
            else is.insert(j);
            // cout << j << endl;
        }
        sum += cnt;
    }
    cout << n  - sum + 1 << endl;
}
