#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
const int MOD = 1000000007;
const int INF = 1000000;
ll a=1,b=1,ans,M,temp;
ll A[5010], N;
string str="1";
ll dp[100000000];
ll powr(ll n,ll p){

    if(p==0)return 1;
    if(p%2==0){
        ll t=powr(n,p/2)%MOD;
        return t*t%MOD;
    }else   return powr(n,p-1) * n %MOD;
}

// 100^n+(100^n-1)/99 1/99 (10^2i -1)
 int main(){
     scanf("%lld",&N);
     a=powr(100,N-1)%MOD+(powr(100,N-1)-1)*powr(99,(MOD-2))%MOD;
     REP(i,N%11){
         if(N==0){str="0";break;}
         if(i==1)continue;
         str += "01";
     }
     cout<<a<<endl<<str<<endl;

     return 0;

 }