#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

ll mo = 1000000007;

//二分累乗法 xのe乗
ll binpow(ll x, ll e)
{
  ll a = 1, p = x;
  while(e > 0) {
    if(e%2 == 0) {p = (p*p) % mo; e /= 2;}
    else {a = (a*p) % mo; e--;}
  }
  return a;
}

ll f(ll n) {
  if(n == 1) return 1;
  if(n%2)
    return (f(n-1) * 100 + 1) % mo;
  else
    return f(n/2) * (binpow(100, n/2) + 1) % mo;
}

ll a[] = {1,101,10101,1010101,101010101,10101010101,1010101010101,101010101010101,10101010101010101,1010101010101010101,0 };

signed main(void)
{
  ll n;
  cin >> n;
  cout << f(n) << endl << a[(n-1)%11] << endl;
  return 0;
}