#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

int64 N, A[10000], L[10000], B;

int64_t mod_pow(int64_t x, int64_t n, int64_t mod) {
  int64_t ret = 1;
  while(n > 0) {
    if(n & 1) (ret *= x) %= mod;
    (x *= x) %= mod;
    n >>= 1;
  }
  return ret;
}


int64 f(int64 x, int64 l, int length) {
  if(l == 1) return x % B;
  int64 ret = 0;
  int64 res = f(x, l / 2, length);
  if(l & 1) {
    ret += res;
    ret += res * mod_pow(10, (l / 2) * length, B) % B;
    ret %= B;
    ret += x * mod_pow(10, (l - 1) * length, B) % B;
  } else {
    ret += res;
    ret += res * mod_pow(10, (l / 2) * length, B) % B;
    ret %= B;
  }
  return ret;
}

int main() {

  // cin >> N;
  N = 2;
  A[0] = 1;
  L[0] = 1;
  A[1] = 3;
  cin >> L[1];
  B = 1e9 + 7;
  int64 ret = 0, sum = 0;
  for(int i = N - 1; i >= 0; i--) {
    int sz = (int) to_string(A[i]).size();
    (ret += f(A[i], L[i], sz) * mod_pow(10, sum, B) % B) %= B;
    sum += 1LL * sz * L[i];
  }
  cout << ret << endl;
}