#include <bits/stdc++.h>
using namespace std;
const int N = 705, sac = 1e9 + 7;
;
int f[10][N][N][2];
int a[N];
int main() {
  string s;
  cin >> s;
  int n = s.length();
  for (int i = 1; i <= n; ++i) a[i] = s[i - 1] - 48;
  for (int i = 0; i < 10; ++i) f[i][0][0][0] = 1;
  for (int i = 0; i < n; ++i)
    for (int k = 0; k < 10; ++k)
      for (int j = 0; j <= i; ++j)
        for (int l = 0; l < 2; ++l)
          for (int p = l ? 9 : a[i + 1]; p >= 0; --p)
            f[k][i + 1][j + (p >= k)][l | p < a[i + 1]] =
                (f[k][i + 1][j + (p >= k)][l | p < a[i + 1]] + f[k][i][j][l]) %
                sac;
  int ans = 0;
  for (int k = 1; k < 10; ++k) {
    long long temp = 0;
    for (int j = 0; j <= n; ++j) {
      ans = (ans + (f[k][n][j][1] + f[k][n][j][0]) * temp) % sac;
      temp = (temp * 10 + 1) % sac;
    }
  }
  cout << ans;
  return 0;
}
