#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
typedef vector<vector<int>> Graph;
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }

//main area
int main(){
    /*
    cout << fixed << setprecision(20);
    ll bunbo = 1;
    ll bunshi = 1;
    for(int i=0;i<20;i++){
        bunshi += bunbo;
        swap(bunshi, bunbo);
        bunshi += bunbo;
        ld r2 = (bunshi*1.0) / (bunbo*1.0);
        cout << bunshi << " / " << bunbo << " : " << r2 << endl;
    }
    */
    ll UP_r2 = 54608393, DOWN_r2 = 38613965; // A = DOWN_r2 * x + UP_r2 * y
    vector<ll> Vec_seisuu(200000);
    vector<ll> Vec(200000, 0);
    vector<ll> Vec_cum(200000, 0);
    vector<ll> Vec_cum2(200000, 0);
    for(int i = 0;i < 200000;i++){
        ll i_r2 = (UP_r2 * i) / DOWN_r2; // i√2 の整数部分
        Vec_seisuu[i] = i_r2;
        if(i_r2 < 200000) Vec[i_r2] = 1;
    }
    for(int i = 0;i < 200000;i++){
        if(i == 0) Vec_cum[i] = Vec[i];
        else Vec_cum[i] = Vec_cum[i-1] + Vec[i];
    }
    for(int i = 0;i < 200000;i++){
        if(i == 0) Vec_cum2[i] = Vec_cum[i];
        else Vec_cum2[i] = Vec_cum2[i-1] + Vec_cum[i];
    }
    /*
    rep(i,11) cout << Vec[i] << ' ';
    cout << endl;
    rep(i,11) cout << Vec_cum[i] << ' ';
    cout << endl;
    rep(i,11) cout << Vec_cum2[i] << ' ';
    cout << endl;
    */

    ll N;
    cin >> N;
    if(N == 1){
        cout << "0 0" << endl;
        return 0;
    }
    ll seisuu;
    for(int i=0;i<200000-1;i++){
        if(Vec_cum2[i] < N && N <= Vec_cum2[i+1]){
            seisuu = i+1;
            break;
        }
    }
    // cout << seisuu << endl;
    vector<pair<ll,ll>> amari(Vec_cum[seisuu]); // pair(amari, a+√2b の a)
    for(int i = 0;i < Vec_cum[seisuu];i++){
        ll a = i*UP_r2 % DOWN_r2;
        amari[i] = make_pair(a, i);
    }
    sort(amari.begin(),amari.end());
    ll Num = N-Vec_cum2[seisuu-1]-1;
    // B = amari[Num]
    cout << seisuu - Vec_seisuu[amari[Num].second] << ' ' << amari[Num].second << endl;
}
/*



}
*/