#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010

struct Mat{
  ll val[2][2];
};

Mat power(ll n, Mat matrix){
  Mat mat2 = {0,0,0,0};

  if(n==1){
    return matrix;
  }
  
  for(int i=0;i<2;i++){
    for(int j=0;j<2;j++){
      for(int k=0;k<2;k++){
        mat2.val[i][j] = (mat2.val[i][j] + matrix.val[i][k] * matrix.val[k][j])%mod;
      }
    }
  }

  Mat res = power(n/2, mat2);

  if(n%2 == 1){
    Mat res2 = {0,0,0,0};
    
    for(int i=0;i<2;i++){
      for(int j=0;j<2;j++){
        for(int k=0;k<2;k++){
          res2.val[i][j] = (res2.val[i][j] + res.val[i][k] * matrix.val[k][j])%mod;
        }
      }
    }

    return res2;
  }

  return res;
}

int main(){
  ll n;
  cin >> n;

  /*
    [100 1][a_i] = [a_i+1]
    [ 0  1][ 1 ] = [  1  ]
  */

  if(n == 1){
    puts("1\n1");
    return 0;
  }
  
  Mat matrix = {100, 1, 0, 1};
  
  matrix = power(n-1,matrix);

  printf("%lld\n",(matrix.val[0][0] + matrix.val[0][1])%mod);

  if(n%11){
    for(int i=0;i<n%11-1;i++){
      printf("10");
    }
    puts("1");
  }else{
    puts("0");
  }
  return 0;
}