#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <deque>
#include <stack>
#include <atcoder/all>

using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
#define all(i,n) (i),(i+n)

int dx4[4]={1,0,-1,0};
int dy4[4]={0,-1,0,1};
int dx8[8]={1,0,-1,1,-1,1,0,-1};
int dy8[8]={1,1,1,0,0,-1,-1,-1};

typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;

const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6+1;
const ll mod = 1e9 + 7;
//  cout << fixed << setprecision(10)
// --------------------------------------
string s;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> s;
  int sl = s.size();
  ll dp[sl + 1][2];
  REP(i, sl + 1) REP(j, 2) dp[i][j] = 0;

  REP(i, sl) {
    for(int smaller = 0; smaller < 2; smaller++) {
      for(int x = 1; x <= (smaller ? 9 : s[i] - '0'); x++){
        ll t = dp[i][smaller] * x % mod;
        dp[i + 1][smaller || x < s[i] - '0'] = (dp[i + 1][smaller || x < s[i] - '0'] + t) % mod;
      }
    }

    for(int x = 1; x <= (i == 0 ? s[0] - '0' : 9); x++) {
      dp[i + 1][i != 0 || x < s[0] - '0'] = (dp[i + 1][i != 0 || x < s[0] - '0'] + x) % mod;
    }
  }

  cout << (dp[sl][0] + dp[sl][1]) % mod << endl;
}