#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll MOD;
ll solve(string s){
	int n=s.size();
	if(n==1) return s[0]-'0';
	ll dp[2][100010]={};
	dp[0][0]=1, dp[1][0]=s[0]-'0'-1;
	for(int i=1; i<n; i++){
		(dp[1][i]+=dp[1][i-1]*10)%=MOD;
		(dp[0][i]+=dp[0][i-1])%=MOD;
		(dp[1][i]+=dp[0][i-1]*(s[i]-'0'))%=MOD;
	}
	ll ans=dp[1][(n-1)/2];
	bool nuo=1;
	for(int i=(n-1)/2+1; i<n; i++){
		if(s[i]>s[n-1-i]) break;
		else if(s[i]<s[n-1-i]){
			nuo=0; break;
		}
	}
	if(nuo) ans=(ans+1)%MOD;
	ll p[100010];
	p[0]=1;
	for(int i=1; i<=n; i++) p[i]=p[i-1]*10%MOD;
	for(int i=1; i<n; i++){
		(ans+=(p[(i+1)/2]-p[(i-1)/2]+MOD))%=MOD;
	}
	return ans;
}
int main()
{
	string s; cin>>s;
	MOD=1e9;
	cout<<solve(s)<<endl;
	MOD=1e9+7;
	cout<<solve(s)<<endl;
	return 0;
}