#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int64 mod = 1e9 + 7;

using pi = pair< int, int >;

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

map< int64, int64 > memo[2];

int64 rec(int64 length, bool l) {
  if(length == 1) return l ? 1 : 3;
  if(memo[l].count(length)) return memo[l][length];
  int64 mid = length >> 1;
  int64 ret = 0;
  (ret += rec(mid, false)) %= mod;
  (ret += rec(length - mid, l) * power(10, mid) % mod) %= mod;
  return memo[l][length] = ret;
}

int main() {
  int64 N;
  cin >> N;
  assert(1LL <= N && N <= 1000000000000000000LL);
  cout << rec(N + 1, true) << endl;
}