#include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  cin >> n;
  if(n%100==0){
    cout << n/100 << endl;
  }
  else{
    cout << n/100 +1 << endl;
  }
}
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#define INF 100000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;

ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }


int main() {
  ll n;
  cin >> n;
  ll ans = 2;
  for (ll i = 3; i <= n; i++) {
    ans = lcm(ans, i);
  }
  cout << ans+1 << endl;
  
  return 0;
}