#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=1e9+7;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=(x%z+z)%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}

const int mod2=mod-1;

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	// a < b sqrt(2) ?
    auto f=[&](ll a,ll b)->bool{
        return a*a<b*b*2;
    };
    // in : a
    // out : max(b)
    // s.t b sqrt(2) < a
    auto g=[&](ll a)->ll{
        ll l=0,r=a;
        while(r-l>1){
            ll m=(l+r)/2;
            if(f(a,m)) r=m;
            else l=m;
        }
        return l;
    };
    ll N;
    cin>>N;
    if(N==1){
        cout<<"0 0\n";
        return;
    }
    if(N==2){
        cout<<"1 0\n";
        return;
    }
    ll X=0,C=1;
    while(C<N){
        X++;
        C+=g(X)+1;
    }
    C-=g(X)+1;
    vector<pair<ll,ll>> p;
    rep(i,0,X+1){
        ll a=i,b=g(X-i);
        if(i==X||f(X-1-i,b)) p.push_back({a,b});
    }
    sort(all(p),[&](pair<ll,ll> l,pair<ll,ll> r){
        bool tmp=f(l.first-r.first,l.second-r.second);
        if(l.first<r.first) return !tmp;
        return tmp;
    });
    C=N-C-1;
    cout<<p[C].first<<" "<<p[C].second<<"\n";
    //cout<<X<<" "<<C<<endl;
    //for(auto x:p) cout<<x.first<<" "<<x.second<<endl;
}