#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
const int LIM=2e5;
long B[LIM];
long cnt[LIM];
bool f(pair<long,long>p,pair<long,long>q)
{//p<q
	long a=p.first,b=p.second;
	long c=q.first,d=q.second;
	if(a-c<0)
	{
		if(d-b<0)return (a-c)*(a-c)>2*(d-b)*(d-b);
		else return true;
	}
	else
	{
		if(d-b<0)return false;
		else return (a-c)*(a-c)<2*(d-b)*(d-b);
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	B[0]=1;
	cnt[0]=1;
	for(int c=1;c<LIM;c++)
	{
		long b=B[c-1]-1;
		long d=(long)c*c;
		while(2*(b+1)*(b+1)<=d)b++;
		B[c]=b+1;
		cnt[c]=cnt[c-1]+B[c];
	}
	long N;cin>>N;
	if(N==1)
	{
		cout<<"0 0\n";
		return 0;
	}
	long L=0,R=LIM-1;
	while(R-L>1)
	{
		long mid=(L+R)/2;
		if(cnt[mid]>=N)R=mid;
		else L=mid;
	}
	vector<pair<long,long> >A;
	N-=cnt[L];
	long a=R,b=0;
	A.push_back(make_pair(a,b));
	while(a>0)
	{
		a--;
		if(!f(make_pair(L,0),make_pair(a,b)))b++;
		A.push_back(make_pair(a,b));
	}
	sort(A.begin(),A.end(),f);
	assert(N<=A.size());
	cout<<A[N-1].first<<" "<<A[N-1].second<<endl;
}