#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

string n;
const LL MOD1 = 1e9;
const LL MOD2 = 1e9 + 7;

int main() {
	cin >> n;
	
	int m = n.size();
	if(m % 2 == 0) {
		dec(i, m / 2) {
			if(n[i] != n[m - 1 - i]) {
				if(n[i] > n[m - 1 - i]) {
					dec(j, m / 2) {
						if(n[j] != '0') { n[j]--; break; } else { n[j] = '9'; }
					}
				}
				break;
			}
		}
	} else {
		dec(i, m / 2) {
			if(n[i] != n[m - 1 - i]) {
				if(n[i] > n[m - 1 - i]) {
					dec(j, m / 2 + 1) {
						if(n[j] != '0') { n[j]--; break; } else { n[j] = '9'; }
					}
				}
				break;
			}
		}
	}
	
	LL ans1 = 0;
	LL ans2 = 0;
	LL v1 = 9;
	LL v2 = 9;
	inc1(i, m - 1) {
		if(i > 1 && i % 2 == 1) {
			(v1 *= 10) %= MOD1;
			(v2 *= 10) %= MOD2;
		}
		(ans1 += v1) %= MOD1;
		(ans2 += v2) %= MOD2;
	}
	{
		int i = m;
		v1 = (n[0] - '0' - 1);
		v2 = (n[0] - '0' - 1);
		incID(j, 1, (i + 1) / 2) {
			v1 = (v1 * 10 + (n[j] - '0')) % MOD1;
			v2 = (v2 * 10 + (n[j] - '0')) % MOD2;
		}
		(v1 += 1) %= MOD1;
		(v2 += 1) %= MOD2;
		
		(ans1 += v1) %= MOD1;
		(ans2 += v2) %= MOD2;
	}
	
	cout << ans1 << endl;
	cout << ans2 << endl;
	
	return 0;
}