#include <iostream>
using namespace std;

constexpr long long mod = 1e9 + 7;

template <typename T>
T powmod(T a, T n, T m){
	T r = 1;
	while(n){
		if(n & 1) (r *= a) %= m;
		(a *= a) %= m;
		n >>= 1;
	}
	return r;
}

long long f(long long n){
	if(n == 0) return 0;
	if(n == 1) return 1;
	if(n & 1) return f(n - 1) * 100 + 1;
	return f(n / 2) % mod * (powmod(100ll, n / 2, mod) + 1) % mod;
}

int main(){
	long long n;
	cin >> n;
	cout << f(n) % mod << endl;
	n %= 11;
	if(!n){
		cout << n << endl;
		return 0;
	}
	cout << 1;
	for(int i = 1; i < n; i++) cout << "01";
	cout << endl;
}