#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 707;
char s[N];
int dp[N][N][10][2];
int main() {
  scanf("%s", s + 1);
  int n = strlen(s + 1);
  for (int i = 1; i < 10; i++) {
    dp[0][0][i][0] = 1;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      for (int k = 1; k < 10; k++) {
        for (int o = 0; o < 2; o++) {
          for (int p = 0; p <= (!o ? s[i + 1] - '0' : 9); p++) {
            (dp[i + 1][j + (p >= k)][k][o | p < s[i + 1] - '0'] +=
             dp[i][j][k][o]) %= MOD;
          }
        }
      }
    }
  }
  long long ans = 0;
  for (int k = 1; k < 10; k++) {
    for (long long i = 1, p = 1; i <= n; i++, p = (p * 10 + 1) % MOD) {
      (ans += p * (dp[n][i][k][0] + dp[n][i][k][1]) % MOD) %= MOD;
    }
  }
  printf("%I64d\n", ans);
  return 0;
}
