#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
typedef long long ll;


ll MOD1 = 1000000007;
ll MOD2_IND = 11;
ll N;

ll calcpow(ll n)
{
    if (n == 1) {
        return 100;
    }
    if (n % 2 == 0) {
        ll a = calcpow(n / 2);
        return (ll)(a * a) % MOD1;
    } else {
        return (ll)(calcpow(n - 1) * 100) % MOD1;
    }
}

ll calc(ll n)
{
    if (n <= 1) {
        return 1;
    }
    if (n % 2 == 0) {
        return (ll)(calc(n / 2) * (calcpow(n / 2) + 1)) % MOD1;
    } else {
        return ((ll)(calc(n - 1) * 100) + 1) % MOD1;
    }
}

int main()
{
    cin >> N;
    ll n1 = N % (MOD1 - 1);
    if (n1 == 0) {
        n1 = MOD1 - 1;
    }
    cout << calc(n1) << endl;

    ll n2 = N % MOD2_IND;
    if (n2 == 0) {
        cout << 0 << endl;
        return 0;
    }
    ll num2 = 1;
    rep(i, n2 - 1)
    {
        num2 = ((ll)(num2 * 100) + 1);
    }
    cout << num2 << endl;
    return 0;
}