#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define int long long
using namespace std;
typedef long long ll;
typedef vector<vector<ll>> mat;
const int INF = 1e9;

int modpow(long long a, long long b, int m) {
    int ret = 1;
    while (b > 0) {
        if (b & 1) ret = 1LL * ret * a % m;
        a = 1LL * a * a % m;
        b >>= 1;
    }
    return ret;
}

int modpowsum(long long a, long long b, int m) {
    if (b == 0) return 0;
    if (b & 1) return (1LL * modpowsum(a, b - 1, m) * a + 1) % m;
    int res = modpowsum(a, b >> 1, m);
    return (1LL * res * (modpow(a, b >> 1, m) + 1)) % m;
}

signed main()
{
    int N;

    cin >> N;
    int len = 2 * (N % 22) - 1;
    len %= 22;

    cout << modpowsum(100, N, MOD) << endl;

    bool one = true;
    REP(i,len) {
        if (one) {
            cout << '1';
            one = false;
        } else {
            cout << '0';
            one = true;
        }
    }
}