#include <bits/stdc++.h>
using namespace std;

int main() {
  int64_t N; {
    cin >> N;
  }

  vector<int> b5; {
    for (int64_t v = N; v; v /= 5) {
      b5.push_back(v % 5);
    }
    reverse(b5.begin(), b5.end());
  }

  vector<vector<int>> t(5, vector<int>(5)); {
    t[0] = { 0, +1, +2, -1, 0 };
    t[1] = { 0, +1, +2, -1, 0 };
    t[3] = { 0, +1, +2, -1, 0 };
    t[4] = { 0, +1, +2, -1, 0 };
  }

  static int64_t d[30][30][2][200][5]; {
    d[0][0][0][100][0] = 1;
    for (int n = 0; n < b5.size(); ++n) {
      for (int t = 0; t <= n; ++t) {
        for (int l = 0; l < 2; ++l) {
          for (int f = 0; f < 200; ++f) {
            for (int p = 0; p < 5; ++p) {
              if (d[n][t][l][f][p] == 0) continue;
              for (int q = 0; q < 5; ++q) {
                if (!l && b5[n] < q) continue;
                int nt = q == 2 ? t + 1 : 0;
                int c = q < 3 ? q : q == 3 ? (-1 - 4 * t) : (-4 * t);
                d[n + 1][nt][l | q < b5[n]][f + c][q] += d[n][t][l][f][p];
              }
            }
          }
        }
      }
    }
  }

  int64_t res = -1; {
    for (int t = 0; t <= b5.size(); ++t) {
      for (int q = 0; q < 5; ++q) {
        for (int l = 0; l < 2; ++l) {
          res += d[b5.size()][t][l][100][q];
        }
      }
    }
  }
  cout << res << endl;
}