#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=ll(a);i<ll(b);i++)
#define irep(i,a,b) for(ll i=ll(a);i>=ll(b);i--)
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#define endl "\n"
using ll=long long;
using ld=long double;
using namespace std;
ll mod= 1e9+7;
ll GCD(ll a, ll b) { return b ? GCD(b, a%b) : a; }

ll a[330000];
map<ll,ll>x;
int main(){
  ll n,ans=0;
  cin>>n;
  cout<<ceil(n/100.0);
}
#include<bits/stdc++.h>
using namespace std;

int main()
{
	#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
	#endif	
	string s;
	cin>>s;
	int count = 0;
	for (int i = 0; i < s.size(); ++i)
	{
		if (s[i] == 'Z')
		{
			if (s[i+1] == 'O')
			{
				if (s[i+2] == 'N')
				{
					if (s[i+3] == 'e')
					{
						count++;
					}
				}
			}
		}
	}
	cout<<count<<'\n';
	return 0;
}
