#include <iostream>
#include <string>
#include <vector>
using namespace std ;
using ll = long long ;
ll mod = 1e9+7 ;

int main(){
	string n ; cin >> n ;
	int d = n.size() ;
	vector<int> sum = {0,1,3,6,10,15,21,28,36,45} ;
	vector<ll> pow45(d,1) ;
	for(int i=1;i<d;i++) pow45[i] = pow45[i-1]*45%mod ;
	ll ans = sum[n[0]-'0'-1]*pow45[d-1]%mod ;
	ll mul = n[0]-'0' ;
	for(int i=1;i<d;i++){
		ans += pow45[d-i] ;
		ans += sum[max(0,n[i]-'0'-1)]*pow45[d-i-1]%mod*mul%mod ;
		ans %= mod ;
		mul = mul*(n[i]-'0')%mod ;
	}
	ans += mul ;
	cout << ans%mod << endl ;
}