#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const double pi = acos(-1);
const double eps = 1e-10;

int MOD[2] = {1000000000, 1000000007};
ll f9[50005][2];
string s;
pll f(int l, int r, bool z, bool m){
  int d = s[l] - '0';
  if(r-l < 1) return (m ? mp(1ll, 1ll) : mp(0ll, 0ll));
  ll r1 = 0, r2 = 0;
  pll ret;
  if(!z) d--;
  if(m ? s[l] > s[r-1] : s[l] >= s[r-1]){
    ret = f(l+1, r-1, true, false);
  }else{
    ret = f(l+1, r-1, true, true);
  }
  ret.fi = (ret.fi + d * f9[(r-l-1)/2][0]) % MOD[0];
  ret.se = (ret.se + d * f9[(r-l-1)/2][1]) % MOD[1];
  return ret;
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  f9[0][0] = 1;
  f9[0][1] = 1;
  FOR(i, 1, 50005)FOR(j, 0, 2)f9[i][j] = f9[i-1][j] * 10 % MOD[j];
  cin >> s;
  pll ans = f(0, sz(s), false, true);
  ll a[2];
  a[0] = ans.fi;
  a[1] = ans.se;
  FOR(i, 1, sz(s))FOR(j, 0, 2) a[j]= (a[j] + 9 * f9[(i-1)/2][j]) % MOD[j];
  FOR(i, 0, 2)cout << a[i] << endl;
  return 0;
}