#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    /*
    int n;
    cin >> n;

    int ma = 0;
    int a,b;
    int cnt = 0;
    srep(i,1,n+1){
        srep(j,i,n+1){
            int x = i*j;
            int val = 0;
            while(x > 0){
                val += x % 10;
                x /= 10;
            }
            if(val > ma){
                ma = val;
                a = i;
                b = j;
                cnt = 1;
            }else if(val == ma){
                cnt++;
            }
        }
    }

    cout << a << ' ' << b << ' ' << a * b << endl;
    cout << ma << ' ' << cnt << endl;
    */


    int n; cin >> n;
    if(n == 0){
        cout << "9 1" << endl;
        return 0;
    }

    cout << (n*2+1) * 9 - 1 << ' ' << 1 << endl;

    return 0;
}