
#include <iostream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

using namespace std;

int main()
{
    int N;
	cin >> N;
	
    int ans = (N - 1) / 100 + 1;
	
    cout << ans << endl;
			
    return 0;
}
#include<bits/stdc++.h>

#define ll long long
#define ld long double
#define pb push_back
#define all(v) ((v).begin()),((v).end())
#define rep(i, val, n) for(int i = val; i < (n); i++)
#define repr(i, val, n) for(int i = n - 1; i >= val; i--)
using namespace std;
const ll mod = 1e9 + 7;
const ll inf = 2e18 + 100;
const double eps = 1e-7;
const ld pi = acos(-1);
const int N = 1e5 + 2;
//bool is_vowel(char a){ return (a=='A' || a=='E' || a=='O' || a=='I' || a=='U');}
//int dx[] = {2,-2,2,-2,1,1,-1,-1}, dy[] = {1,1,-1,-1,2,-2,2,-2}; // knight moves
//int dx[] = {0,0,1,1,1,-1,-1,-1}, dy[] = {-1,1,-1,0,1,-1,0,1}; // 8 adjacent neighbours
//int dx[] = {0,0,1,-1}, dy[] = {-1,1,0,0}; //4 adjacent neighbours
//bool inside(int x, int y,int n,int m){ return (x >= 0 && x < n && y >= 0 && y < m);}
void test() {
    int n;cin>>n;
    cout<<(n + 99) / 100;
}

int main() {
//    precompute();
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int cases = 1, c = 1;
//    cin >> cases;
    while (cases--) {
//        cout<<"Case #"<<c++<<": ";
        test();
    }
    return 0;
}