#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)

const int mod = 1e9 + 7;

int getpow(int val, int p) {
  int ans = 1, i = 0;
  while(p >> i) {
    if((p >> i) & 1LL) (ans *= val) %= mod;
    (val *= val) %= mod; i++;
  }
  return ans;
}
    
int f(int n) {
  if(n == 1) return 1;
  return n % 2 ? (f(n - 1) * 100 + 1) % mod : (f(n / 2) * (getpow(100, n / 2) + 1)) % mod;
}

signed main()
{
  int N;
  int ans2 = 0;
  
  cin >> N;
  
  cout << f(N) << endl;

  N %= 11;
  if(!N) cout << 0 << endl;
  else {
    N--; cout << "1";
    Rep(i, N) cout << "01";
    cout << endl;
  }
  return 0;
}