#include <bits/stdc++.h>
using namespace std;
const int p = 1e9 + 7;
template <typename T>
inline T read() {
  register T sum = 0;
  register char cc = getchar();
  int sym = 1;
  while (cc != '-' && (cc > '9' || cc < '0')) cc = getchar();
  if (cc == '-') sym = -1, cc = getchar();
  sum = sum * 10 + cc - '0';
  cc = getchar();
  while (cc >= '0' && cc <= '9') sum = sum * 10 + cc - '0', cc = getchar();
  return sym * sum;
}
template <typename T>
inline T read(T &a) {
  a = read<T>();
  return a;
}
template <typename T, typename... Others>
inline void read(T &a, Others &...b) {
  a = read(a);
  read(b...);
}
int n, ans, f[710][710][10][2];
char s[710];
int add(int x, int y) {
  x += y;
  return x >= p ? x - p : x;
}
void Add(int &x, int y) {
  x += y;
  if (x >= p) x -= p;
}
int mul(int x, int y) { return 1ll * x * y % p; }
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  for (int i = 0; i <= 9; i++) f[0][0][i][1] = 1;
  for (int i = 1; i <= n; i++) {
    s[i] -= '0';
    for (int j = 0; j <= i; j++)
      for (int k = 0; k <= 9; k++)
        for (int l : {0, 1})
          for (int p = 0, lim = l ? s[i] : 9; p <= lim; p++)
            Add(f[i][j + (k <= p)][k][l & (p == lim)], f[i - 1][j][k][l]);
  }
  for (int i = 1; i <= 9; i++)
    for (int j = 1, k = 1; j <= n; j++, k = add(mul(k, 10), 1))
      Add(ans, mul(k, add(f[n][j][i][0], f[n][j][i][1])));
  printf("%d\n", ans);
  return 0;
}
