#include <iostream>
#include <vector>
using namespace std;
using i64 = int64_t;

constexpr int mod0 = 1'000'000'000,
              mod1 = 1'000'000'007;

int cmp(int x, int y) {
  if(x <  y) { return 0; }
  if(x == y) { return 1; }
  return 2;
}

i64 f(const string &s, int mod) {
  // dp[未満/丁度/超過 上から][未満/丁度/超過 下から] := パターン数
  int n = static_cast<int>(s.size());
  vector<vector<i64>> dp(3, vector<i64>(3, 0)), ndp;
  dp[1][1] = 1;
  for(int i=0; i<=n-1-i; ++i) {
    ndp.assign(3, vector<i64>(3, 0));
    for(int state0=0; state0<3; ++state0) {
      for(int state1=0; state1<3; ++state1) {
        if(!dp[state0][state1]) { continue; }
        for(int d=(i==0); d<10; ++d) { // ちょうど n 桁にする
          int nstate0 = state0,
              nstate1 = cmp(d, s[n-1-i]-'0');
          if(nstate0 == 1) { nstate0 = cmp(d, s[i]-'0'); }
          if(nstate1 == 1) { nstate1 = state1; }
          if(nstate0 == 2) { continue; }
          ndp[nstate0][nstate1] += dp[state0][state1];
          ndp[nstate0][nstate1] %= mod;
        }
      }
    }
    swap(dp, ndp);
  }
  i64 res = 0;
  for(int state1=0; state1<3; ++state1) {
    res += dp[0][state1];
    res %= mod;
  }
  for(int state1=0; state1<2; ++state1) {
    res += dp[1][state1];
    res %= mod;
  }
  return res;
}

vector<i64> p10;

i64 solve(const string &s, int mod) {
  int n = static_cast<int>(s.size());
  p10.assign(n+5, 0);
  p10[0] = 1;
  for(int i=0; i<n; ++i) {
    p10[i+1] = p10[i] * 10 % mod;
  }
  i64 res = f(s, mod);
  for(int k=1; k<n; ++k) {
    i64 val = p10[(k-1)/2] * 9 % mod;
    res += val;
    res %= mod;
  }
  return res;
}

int main(void) {
  string s; cin >> s;
  i64 res0 = solve(s, mod0),
      res1 = solve(s, mod1);
  cout << res0 << '\n' << res1 << '\n';
  return 0;
}