#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
 
const int inf = (int)1e9; 

ll Pow(ll x,ll power,ll r){
	ll res = 1;
	ll k = power;
	ll y = x%r;
	while (k) {
		if (k & 1)res = (res*y) % r;
		y = (y%r*y%N) % r;
		k /= 2;
	}
	return res;
}


int main(void){
    ll n;
    cin>>n;
    ll ans1 = 0;
    ans1 = Pow(99LL,N-2,N);
    ll tmp1 = Pow(100LL,n,N);
    cout<<((tmp1-1)*ans1)%N<<endl;
    n = n%11;
    string ans2;
    for(int i=1;i<=n-1;i++){
        ans2.push_back('1');
        ans2.push_back('0');
    }
    ans2.push_back('1');
    if(n%11==0)cout<<0<<endl;
    else cout<<ans2<<endl;
    return 0;
}