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