#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define ee cout << "\n"
#define pb push_back
#define mkp make_pair
#define sall(v) sort(v.begin(), v.end())
#define fo(i, n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vll vector<pair<ll, ll>>
#define mpl map<ll, ll>
#define pr pair<ll, ll>
//Fast input output
void setIO(string s = "")
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin.exceptions(cin.failbit);
    if (s.size())
    {
        freopen((s + ".in").c_str(), "r", stdin);
        freopen((s + ".out").c_str(), "w", stdout);
    }
}
void solve()
{
    ll n;
    cin >> n;
    cout << (n + 99) / 100;
    ee;
}
int main()
{
    setIO();
    ll totalTestCase = 1;
    //  cin>>totalTestCase;
    for (ll testCase = 1; testCase <= totalTestCase; testCase++)
    {
        solve();
    }
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main(){
    long long int n;
    cin>>n;
    long long int ans=n/100;
    if(n%100!=0)
    ans+=1;
    cout<<ans;
}