#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

ll extgcd(ll a, ll b, ll &x, ll &y){
  ll d = a;
  if(b!=0){
    d = extgcd(b,a%b,y,x);
    y -= (a/b)*x;
  }else{
    x = 1; y = 0;
  }
  return d;
}

ll mod_inverse(ll a, ll m){
  ll x, y;
  extgcd(a, m, x, y);
  return (m+x%m)%m;
}

ll mod_pow(ll x, ll n, ll mod){
  if(n==0) return 1;
  ll res = mod_pow(x * x % mod, n / 2, mod);
  if(n & 1) res = res * x % mod;
  return res;
}


ll solve(ll n){
  ll MOD = 1000000007LL;
  
  ll ret = (mod_pow(100, n, MOD)-1+MOD)%MOD;
  ret *= mod_inverse(99, MOD);
  ret %= MOD;
  
  return ret;
}

string solve2(ll n){
  ll x = n%11;
  if(x == 0) return "0";
  string ret = "1";
  REP(i,1,x){
    ret += "01";
  }
  return ret;
}

int main(){
  ll N;
  cin >> N;
  
  cout << solve(N) << endl;
  cout << solve2(N) << endl;
  
  return 0;
}