#include <stdio.h> #include <atcoder/all> #include <bits/stdc++.h> using namespace std; using namespace atcoder; using mint = modint1000000007; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 4000000000000000001 long long get(long long n){ long long ok = 0,ng = 2000000; while(ng-ok>1LL){ long long mid = (ok+ng)/2; if(mid*mid*2<=n)ok = mid; else ng = mid; } return ok+1; } long long get2(long long n){ long long ng= -1,ok = 1e9; while(ok-ng>1LL){ long long mid = (ok+ng)/2; if(mid*mid*2>n)ok = mid; else ng = mid; } return ok; } int main(){ long long N; cin>>N; if(N==1){ cout<<0<<' '<<0<<endl; return 0; } long long ok = 0,ng = 2000000; while(ng-ok>1LL){ long long mid = (ok+ng)/2; long long sum = 0; for(long long i=0;i<=mid;i++){ long long cur = mid - i; cur *= cur; sum += get(cur); } if(sum<N)ok = mid; else ng = mid; } //cout<<ok<<endl; for(long long i=0;i<=ok;i++){ long long cur = ok - i; cur *= cur; N -= get(cur); //P.emplace_back(i,get2(cur)); } //cout<<N<<endl; vector<pair<long long,long long>> P; for(long long i=0;i<=ok+10;i++){ long long cur = ok-i; if(cur<0){ P.emplace_back(i,0); continue; } cur *= cur; P.emplace_back(i,get2(cur)); //cout<<i<<','<<get2(cur)<<endl; } sort(P.begin(),P.end(),[&](pair<long long,long long> a,pair<long long,long long> b){ long long x = a.first - b.first,y = b.second - a.second; if(x<0&&y>=0)return true; if(y<0&&x>=0)return false; if(x>=0&&y>=0){ return x*x < y*y*2; } else{ return x*x > y*y*2; } }); cout<<P[N-1].first<<' '<<P[N-1].second<<endl; return 0; }