#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <ostream>
#include <queue>
#include <set>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;

int main() {
  int n;
  cin >> n;
  cout << (n + 99) / 100 << endl;
}
#include <bits/stdc++.h>
using namespace std;



int main()
{
    int t;
    t=1;
    while(t--)
    {
        int n;
        cin>>n;
        int ans=n/100;
        if(n%100==0)
            cout<<ans;
        else
            cout<<ans+1;
    }
    return 0;
}



