#include<bits/stdc++.h>
using namespace std;
struct st{
	int a;
	int b;
};
st s; 
priority_queue<st,vector<st> ,less<st> > q;
int main(){
	for(int i=1;i<=5;i++){
		s.a=i*i;
		s.b=i*2;
		q.push(s);
	}
	
	
	while(!q.empty()){
		st x=q.top();
		cout << x.a <<" " << x.b << endl;
		q.pop();
	}
}