#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define FORR(x, arr) for(auto& x:arr)
#define ITR(x, c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

ll N, MOD = 1000000007, a[15];

ll mod_pow(ll x, ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % MOD;
		x = x * x % MOD;
		n >>= 1;
	}
	return res;
}

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> N;
	a[0] = 1;
	for (int i = 1; i <= 11; i++) a[i] = a[i-1]*100+1;
	cout << (mod_pow(100, N)-1+MOD) % MOD * mod_pow(99, MOD-2) % MOD << endl;
	int _N = N % 11 - 1;
	if (_N < 0) _N += 11;
	cout << a[_N] << endl;
	return 0;
}