#include <bits/stdc++.h>
using namespace std;
long long n, a1, a2, mas[1000007], a3, a4, a5, k, a6, l, r, b, mas1[1000007],
    mas2[1000007], m, y, z, x, a, all, last;
long long res;
char t;
set<pair<long long, long long> > s;
string s1, s2;
priority_queue<long long, vector<long long>, greater<long long> > q;
int main() {
  cin >> n;
  res = n / 100;
  n %= 100;
  res += n / 20;
  n %= 20;
  res += n / 10;
  n %= 10;
  res += n / 5;
  n %= 5;
  res += n / 1;
  n %= 1;
  cout << res << endl;
  return 0;
}
