#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

int modpow(int a, int b, int mod) {
	int ret = 1;
	while (b > 0) {
		if (b & 1) {
			ret = 1LL * ret * a % mod;
		}
		a = 1LL * a * a % mod;
		b /= 2;
	}
	return ret;
}

int f(std::string s, int mod) {
	const int n = s.size();
	std::vector<int> dp0(2);
	dp0[0] = 1;

	for (int i = 0; i < (n + 1) / 2; i++) {
		std::vector<int> dp1(2);
		for (int j = 0; j < 2; j++) {
			int L = i == 0 ? 1 : 0;
			int R = j ? 9 : (s[i] - '0');
			for (int d = L; d <= R; d++) {
				(dp1[j || d < R] += dp0[j]) %= mod;
			}
		}
		dp0 = dp1;
	}

	int ret = 0;

	for (int i = 1; i <= n - 1; i++) {
		(ret += 1LL * 9 * modpow(10, (i - 1) / 2, mod) % mod) %= mod;
	}

	(ret += dp0[1]) %= mod;

	std::string t;
	for (int i = 0; i < (n + 1) / 2; i++) {
		t += s[i];
	}
	for (int i = (n + 1) / 2; i < n; i++) {
		t += s[n - 1 - i];
	}
	if (t <= s) {
		(ret += 1) %= mod;
	}
	return ret;
}

int main() {
	std::string s;
	std::cin >> s;

	std::cout << f(s, 1000000000) << std::endl;
	std::cout << f(s, 1000000007) << std::endl;
}