#include<bits/stdc++.h>

#define rep(i, n)for(int i=0;i<(n);i++)
using namespace std;

typedef long long int64;

int64 dp[100001][2];
int64 dp2[100001];

int64 rec2(int idx, const int mod)
{
  if(idx <= 0) return (1);
  if(idx % 2 == 1) return (rec2(idx - 1, mod) * 10 % mod);
  if(~dp2[idx]) return (dp2[idx]);
  return (dp2[idx] = rec2(idx - 2, mod) * 10 % mod);
}

int64 solve(string a, int MOD)
{
  memset(dp2, -1, sizeof(dp2));
  int64 ret = 0;
  for(int i = 0; i < a.size() - 1; i++) {
    ret += rec2(i - 1, MOD) * 9;
    ret %= MOD;
  }
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  rep(i, a.size() / 2)
    rep(j, 2) {
      if(dp[i][j] == 0)continue;
      int g = (j ? 9 : a[i] - '0');
      rep(l, g + 1)(dp[i + 1][j || l < g] += dp[i][j]) %= MOD;
    }
  return (ret);
}

int main()
{
  string b;
  cin >> b;
  int MOD = 1e9;
  if(b.size() % 2 == 1) printf("%lld\n", (solve(b, MOD) + (dp[b.size() / 2][0] + dp[b.size() / 2][1] * 10)) % MOD);
  else printf("%lld\n", (solve(b, MOD) + dp[b.size() / 2][0] + dp[b.size() / 2][1] - 1 + MOD) % MOD);
  MOD = 1e9 + 7;
  if(b.size() % 2 == 1) printf("%lld\n", (solve(b, MOD) + (dp[b.size() / 2][0] + dp[b.size() / 2][1] * 10)) % MOD);
  else printf("%lld\n", (solve(b, MOD) + dp[b.size() / 2][0] + dp[b.size() / 2][1] - 1 + MOD) % MOD);

}