#include <bits/stdc++.h>

using namespace std;

vector <vector<unsigned long long int>> mul(vector <vector<unsigned long long int>> a, vector<vector<unsigned long long int>> b)
{
	vector <vector<unsigned long long int>>c(3, vector<unsigned long long int>(3,0));

	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j <3; j++)
		{
			for (int k = 0; k < 3; k++)
			{
				c[i][j] += ((a[i][k] % 1000000007) * (b[k][j] % 1000000007));
				c[i][j] %= 1000000007;
			}
		}
	}

	return c;
}


int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	long long int N;

	cin >> N;
	vector <vector <unsigned long long int>> a(3, vector<unsigned long long int>(3,0));
	vector <vector <unsigned long long int>> b(3, vector<unsigned long long int>(3,0));
	a[0][0] = 100;
	a[0][2] = 1;
	a[1][0] = 1;
	a[2][2] = 1;

	b[0][0] = 1;
	b[1][1] = 1;
	b[2][2] = 1;

	long long int n = N - 1;
	while (n > 0)
	{
		if (n & 1)
		{
			b = mul(a, b);
		}
		a = mul(a, a);
		n >>= 1;
	}
	
	long long int res = b[0][0];
	res += b[0][1];
	res += b[0][2];
	res %= 1000000007;
	cout << res << '\n';
	if (N % 11 == 0)
	{
		cout << 0 << '\n';
	}
	else
	{
		int n = N % 11;
		for (int i = 0; i < n - 1; i++)
		{
			cout << "10";
		}
		cout << "1" << '\n';
	}
	return 0;
}