#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
  string N;
  cin >> N;
  int M = N.size();
  vector<vector<vector<vector<long long>>>> dp(M + 1, vector<vector<vector<long long>>>(100, vector<vector<long long>>(2, vector<long long>(2, 0))));
  dp[0][1][0][0] = 1;
  for (int i = 0; i < M; i++){
    for (int j = 0; j < 100; j++){
      for (int k = 0; k < 2; k++){
        for (int l = 0; l < 2; l++){
          for (int d = 0; d <= 9; d++){
            if (k == 0 && d > N[i] - '0'){
              continue;
            }
            if (l == 1 && d == 0){
              continue;
            }
            int j2 = j;
            if (d > 0){
              j2 = j * d % 100;
            }
            int k2 = k;
            if (d < N[i] - '0'){
              k2 = 1;
            }
            int l2 = l;
            if (d != 0){
              l2 = 1;
            }
            dp[i + 1][j2][k2][l2] += dp[i][j][k][l];
            dp[i + 1][j2][k2][l2] %= MOD;
          }
        }
      }
    }
  }
  cout << (dp[M][0][0][1] + dp[M][0][1][1]) % MOD << endl;
}