#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

constexpr ll mod=1e9+7;

const int N=10010;
int dp[N][16][2][2];

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	string s; cin >> s;
	int n=s.size();
	dp[0][0][0][1]=1;
	for(int i=0;i<n;i++){
		for(int j=0;j<16;j++){
			for(int k=0;k<2;k++){
				for(int kk=0;kk<2;kk++){
					if(!dp[i][j][k][kk])continue;
					int d=s[i]-'0';
					if(kk){
						dp[i+1][j][1][1]+=dp[i][j][k][kk];
					}
					for(int u=1;u<=9;u++){
						int nk=k;
						if(k==0 and u<d){
							nk=1;
						}
						if(k==0 and u>d)break;
						int nj=j;
						if(u==4 or u==8){
							nj|=(1<<0);
							nj|=(1<<1);
						}
						else if(u%2==0){
							if(j&(1<<0))nj|=(1<<1);
							else nj|=(1<<0);
						}
						if(u==5){
							if(j&(1<<2))nj|=(1<<3);
							else nj|=(1<<2);
						}
						dp[i+1][nj][nk][0]+=dp[i][j][k][kk];
						if(dp[i+1][nj][nk][0]>=mod)dp[i+1][nj][nk][0]-=mod;
					}
				}
			}
		}
	}
	ll res=dp[n][15][0][0]+dp[n][15][1][0];
	cout << res%mod << endl;
}