#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long ll;
 
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())

#define MOD1 1000000000LL
#define MOD2 1000000007LL

int main() {

    string N; cin >> N;

    if(N.size() == 1) {
        cout << N[0] << endl;
        cout << N[0] << endl;
        return 0;
    }

    ll ans1 = -9;
    ll ans2 = -9;

    ll add = 9;
    ll half_d = (ll) N.size() / 2 + (ll) N.size() % 2;
    for(ll i = 0; i <= half_d; i++) {
        if(i % 2 == 0 && i > 0) {
            add *= 10;
            add += 9;
        }
        ans1 += add;
        ans2 += add;
        ans1 %= MOD1;
        ans2 %= MOD2;
    }

    bool flag = true;
    REP(i,N.size() / 2) {
        if(N[i] < N[N.size() - 1 - i]) {
            flag = true;
            break;
        } else if(N[i] > N[N.size() - 1 - i]) {
            flag = false;
            break;
        }
    }

    ll sum1 = 0;
    ll sum2 = 0;
    REP(i,N.size() / 2) {
        sum1 *= 10;
        sum1 += N[i] - '0';
        sum1 %= MOD1;
        sum2 *= 10;
        sum2 += N[i] - '0';
        sum2 %= MOD2; 
    }

    if(!flag) sum1--,sum2--;
    ans1 += sum1;
    ans2 += sum2;
    ans1 %= MOD1;
    ans2 %= MOD2;
     
    cout << ans1 << endl;
    cout << ans2 << endl;

    return 0;
}