#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define ceildiv(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(x) cout << x << endl
#define SP << " " << 
#define inf 1e18
#define mod 1000000007

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;
bool exceed(ll x, ll y, ll m){return x >= m / y + 1;} 

ll n;
string s;
ll dp[100005][2][2];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> s;
	ll n = s.size();
	reverse(all(s));
	
	dp[n][0][0] = 1;
	for(int i = n; i >= 1; i--){
		ll c = s[i-1] -'0';
		rep(j, 0, 1){
			rep(l, 0, 1){
				rep(k, 0, 9){
					ll nj = j, nl = l;
					if(j == 0 && c < k) continue;
					if(c > k) nj = 1;
					if(k != 0) nl = 1;
					if(nl) (dp[i-1][nj][nl] += dp[i][j][l] * k % mod) %= mod;
					else (dp[i-1][nj][nl] += dp[i][j][l] % mod) %= mod;
				}
			}
		}
	}
	
	ll ans = (dp[0][0][1] + dp[0][1][1]) % mod;
	cout << ans << endl;
	
	return 0;
}