#include <iostream>
using namespace std;
// calculate a^b mod m (a < m)
int modpow(long long a, long long b, int m) {
	int ret = 1;
	while (b > 0) {
		if (b & 1) ret = 1LL * ret * a % m;
		a = 1LL * a * a % m;
		b >>= 1;
	}
	return ret;
}
// calculate a^0 + a^1 + a^2 + ... + a^(b-1) mod m (a < m)
int modpowsum(long long a, long long b, int m) {
	if (b == 0) return 0;
	if (b & 1) return (1LL * modpowsum(a, b - 1, m) * a + 1) % m;
	int res = modpowsum(a, b >> 1, m);
	return (1LL * res * (modpow(a, b >> 1, m) + 1)) % m;
}
const int mod = 1000000007;
long long n;
int main() {
	cin >> n;
	cout << modpowsum(100, n, mod) << endl;
	long long x = 0; n %= 11;
	if(n == 0) cout << "0" << endl;
	else {
		cout << "1";
		for(int i = 1; i < n; i++) cout << "01";
		cout << endl;
	}
	return 0;
}