#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()

int main() {
  int n;
  cin >> n;
  int c[4] = {25, 10, 5, 1};
  int ans = 0;
  REP(i, 4) {
    int t = n / c[i];
    ans += t;
    n -= c[i] * t;
  }
  cout << ans << endl;
  return 0;
}
