#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;

int main() {
  string s;
  cin >> s;

  vector dp(s.size()+1, vector(2, vector(3, vector<mint>(3, 0))));
  dp.front().front().front().front() = 1;
  rep2(i, 1, s.size()) dp.at(i).at(1).front().front() = 1;
  rep(i, s.size()) {
    int ni = i+1;
    int now = s.at(i) - '0';
    rep(j, 2)rep(k, 3)rep(l, 3) {
      rep2(m, 1, 10) {
        int nj = j, nk = k, nl = l;
        if(nj == 0) {
          if(m < now) nj++;
          else if(m > now) break;
        }
        if((m == 2 || m == 6) && nk < 2) nk++;
        if(m == 5 && nl < 2) nl++;
        if((m == 4 || m == 8)) nk = 2;
        dp.at(ni).at(nj).at(nk).at(nl) += dp.at(i).at(j).at(k).at(l);
      }

    }
  }
  mint ans = 0;
  rep(j, 2) {
    ans += dp.back().at(j).at(2).at(2);
  }
  cout << ans.val() << endl;
  return 0;
}