#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;map<int,bool>f;
vector<pair<int,int>>ans;
void solve(int n){
	if (f[n]) return ;
	int x=ceil(sqrt(n));
	ans.push_back({x,x*x-n});f[n]=1;
	solve(x);solve(x*x-n);
}
signed main(){
	f[0]=f[1]=f[2]=1;
	cin>>n;solve(n);
	reverse(ans.begin(),ans.end());
	for (auto [x,y]:ans)
		printf("%lld %lld\n",x,y);
	return 0;
}