#include <iostream>
#include <cmath>
 
using namespace std;
 
int main()
{
    int a, x;
    cin>>a;
    if(a%100)
    {
      x=a/100 + 1;
    }
  else
  {
    x=a/100;
  }
    cout<< x << endl;
    return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define int          	long long int
#define pb           	push_back
#define mp           	make_pair
#define all(x)       	x.begin(),x.end()
#define rep(i,a,b)   	for(int i=a;i<b;i++)
#define mem1(a)      	memset (a,-1,sizeof(a))
#define mem0(a)      	memset (a,0,sizeof(a))
#define sz(x)        	(int)((x).size())
#define rr           	return 0
#define f            	first
#define s            	second
#define pii          	pair<int,int>
#define endl         	"\n"
#define bigprime     	1000000007
#define MOD             1000000007
#define gcd(a,b)        __gcd((a),(b))
#define lcm(a,b)        (a/gcd(a,b))*b
#define scanvec(a,n)      rep(i,0,n){cin>>a[i];}
#define printvec(a,n)     rep(i,0,n){cout<<a[i]<<" ";}
/*********************************************************************************************************************************************************/
																																				
//bool ispalindrome(string s){string str = s;reverse(str.begin(),str.end());return(s==str);}                                                     
//bool isPrime(int N){for(int i=2;i*i<=N;++i){if(N%i==0) return false;}return true;}																
//bool isvowel(char x){ ret//longest common subsequence using memoization over recursion															 
//int expo(int a, int b, int mod) {int res = 1; while (b > 0) {if (b & 1)res = (res * a) % mod; a = (a * a) % mod; b = b >> 1;} return res;}          
int mod(int x){return (x%MOD + MOD)%MOD;}																											  
//int modmul(int a, int b) {return ((a%MOD) * (b%MOD)) % MOD;}																						
//int modadd(int a, int b){return mod(mod(a) + mod(b));}																							  
//int modsub(int a, int b){return((a%MOD) - (b%MOD) + MOD)%MOD;}
//vector<int> sieve(int n) {int*a = new int[n + 1](); vector<int> v; for (int i = 2; i <= n; i++)if (a[i] == 0) {v.pb(i); for (int j = 2 * i; j <= n; j += i)a[j] = 1;} return v;}

/*********************************************************************************************************************************************************/
void mahol(){
	int n;cin>>n;
	int cnt =0;
	while(n>0){
		n = n-100;
		cnt++;
		//cout<<cnt<<" ";
	}
	cout<<cnt<<endl;
}
signed main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    //int t;cin>>t;while(t--){mahol();}
    mahol();
	rr;
}