#include <bits/stdc++.h>
using namespace std;
priority_queue<int> lott;
int main() {
  long long int xm, find = 0;
  cin >> xm;
  lott.push(100);
  lott.push(20);
  lott.push(10);
  lott.push(5);
  lott.push(1);
  while (xm) {
    while (lott.top() <= xm) {
      find++;
      xm -= lott.top();
    }
    lott.pop();
  }
  cout << find << endl;
  return 0;
}
