#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll N;

ll hoge(int V) { //V以下の値
	ll ret=0;
	
	for(int a=0;a<=min(V,1000000);a++) {
		ll d=V-a;
		ret++;
		ret+=d/sqrt(2);
	}
	return ret;
}

bool cmp(pair<int,int> L,pair<int,int> R) {
	ll a=L.first-R.first;
	ll b=R.second-L.second;
	assert(a!=0&&b!=0);
	if(a<0&&b>0) return 1;
	if(a>0&&b<0) return 0;
	if(a<0&&b<0) return a*a>2*b*b;
	return a*a<2*b*b;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	int L=0,R=1000000;
	while(R-L>1) {
		int M=(L+R)/2;
		if(hoge(M)>=N) {
			R=M;
		}
		else {
			L=M;
		}
	}
	
	vector<pair<int,int>> V;
	N-=hoge(L);
	for(i=0;i<R;i++) {
		int na=(R-i)/sqrt(2);
		int nb=(L-i)/sqrt(2);
		if(na>nb) V.push_back({i,na});
	}
	V.push_back({R,0});
	assert(V.size()==hoge(R)-hoge(L));
	sort(ALL(V),cmp);
	cout<<V[N-1].first<<" "<<V[N-1].second<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}