#include<bits/stdc++.h>
using namespace std;
#define int long long
int MOD1=1000000000;
int MOD2=1000000007;
string s,t;
int dp1[114514];
int dp2[114514];
int calc2_1(int x,int mod){
  t="";
  int res=0;
  int y=(x+1)/2;
  for(int i=0;i<y;i++){
    t+=s[i];
    for(int j=0;j<10;j++){
      if(i==0&&j==0) continue;
      //cout<<i<<":"<<j<<":"<<s[i]<<":"<<y<<":"<<dp1[y-(i+1)]<<":"<<res<<endl;
      if(s[i]>('0'+j)) (res+=dp1[y-(i+1)])%=mod;
      if(i==y-1&&s[i]=='0'+j){
	string u=t;
	reverse(u.begin(),u.end());
	if(x&1) t.pop_back();
	t+=u;
	//cout<<s<<" "<<t<<endl;
	if(s.compare(t)>=0) res++;
      }
    }
    res%=mod;
  }
  return res;
}

int calc2_2(int x,int mod){
  t="";
  int res=0;
  int y=(x+1)/2;
  for(int i=0;i<y;i++){
    t+=s[i];
    for(int j=0;j<10;j++){
      if(i==0&&j==0) continue;
      //cout<<i<<":"<<j<<":"<<s[i]<<":"<<y<<":"<<dp2[y-(i+1)]<<":"<<res<<endl;
      if(s[i]>('0'+j)) (res+=dp2[y-(i+1)])%=mod;
      if(i==y-1&&s[i]=='0'+j){
	string u=t;
	reverse(u.begin(),u.end());
	if(x&1) t.pop_back();
	t+=u;
	//cout<<s<<" "<<t<<endl;
	if(s.compare(t)>=0) res++;
      }
    }
    res%=mod;
  }
  return res;
}
signed main(){
  cin>>s;
  int ans1=0,ans2=0;
  dp1[0]=dp2[0]=1;
  for(int i=1;i<114514;i++){
    (dp1[i]=dp1[i-1]*10)%=MOD1;
    (dp2[i]=dp2[i-1]*10)%=MOD2;
    //if(i<100) cout<<dp1[i]<<" "<<dp2[i]<<endl;
  }
  //cout<<dp1[0]<<" "<<dp2[0]<<endl;
  for(int i=1;i<(int)s.size();i++){
    (ans1+=9*dp1[(i+1)/2-1])%=MOD1;
    (ans2+=9*dp2[(i+1)/2-1])%=MOD2;
  }
  (ans1+=calc2_1(s.size(),MOD1))%=MOD1;
  (ans2+=calc2_2(s.size(),MOD2))%=MOD2;
  cout<<ans1<<endl<<ans2<<endl;
  return 0;
}