#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=1000000007;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};


LL fpow(LL a, LL n, LL mod){
    LL x = 1;
    while(n > 0){
        if(n&1){
            x=x*a%mod;
        }
        a=a*a%mod;
        n >>= 1;
    }
    return x;
}


vector<string> s({
        "1" , "101" , "10101" , "1010101" , "101010101" , "10101010101" , "1010101010101", "101010101010101", "10101010101010101" , "1010101010101010101", "101010101010101010101"});

int main(){
    LL n;cin >> n;
    cout << (fpow(100, n, mod) - 1 + mod) * fpow(99, mod - 2,mod) %mod << endl;
    cout << s[(n - 1)%s.size()] << endl;
    return 0;
}