#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint1000000007;

int main()
{
    ll x[5]={3, 31, 314, 3141, 31415};
    int n; cin>>n;
    if(n>=4){
        cout<<9*(n*2+1)-1<<" "<<1<<endl;
    }else{
        set<ll> st;
        int ans=0;
        for(ll b=1; b<=x[n]; b++){
            for(ll a=1; a<=b; a++){
                ll c=a*b;
                int s=0;
                while(c){
                    s+=c%10;
                    c/=10;
                }
                if(ans<s){
                    ans=s;
                    st.clear();
                    st.insert(a*b);
                }
            }
        }
        cout<<ans<<" "<<st.size()<<endl;
    }

    return 0;
}