#include <iostream>
#include<bits/stdc++.h>
using namespace std;
void qsortfirst(pair<int,int> p[],int low,int up){
if(low>=up)
return;
pair<int,int> temp;
int i=low+1,j=up,pivot=p[i].first;
while(i<=j){
while(p[i].first<pivot)
i++;
while(p[j].first>pivot)
j--;
if(i<j){
temp=p[i];
p[j]=p[i];
p[i]=temp;
j--;
i++;
}
else if(i==j)
i++;
}
temp=p[j];
p[j]=p[low];
p[low]=temp;
qsortfirst(p,low,j-1);
qsortfirst(p,j+1,up);
}
int main() {
// your code goes here
pair<int,int> p[5];
for(int i=0;i<5;i++)
cin>>p[i].first>>p[i].second;
for(int i=0;i<5;i++)
cout<<p[i].first<<" "<<p[i].second;
qsortfirst(p,0,5);
for(int i=0;i<5;i++)
cout<<p[i].first<<" "<<p[i].second;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBxc29ydGZpcnN0KHBhaXI8aW50LGludD4gcFtdLGludCBsb3csaW50IHVwKXsKCQoJaWYobG93Pj11cCkKCQlyZXR1cm47CglwYWlyPGludCxpbnQ+IHRlbXA7CglpbnQgaT1sb3crMSxqPXVwLHBpdm90PXBbaV0uZmlyc3Q7Cgl3aGlsZShpPD1qKXsKCQl3aGlsZShwW2ldLmZpcnN0PHBpdm90KQoJCQlpKys7CgkJd2hpbGUocFtqXS5maXJzdD5waXZvdCkKCQkJai0tOwoJCWlmKGk8ail7CgkJCXRlbXA9cFtpXTsKCQkJcFtqXT1wW2ldOwoJCQlwW2ldPXRlbXA7CgkJCWotLTsKCQkJaSsrOwoJCX0KCQllbHNlIGlmKGk9PWopCgkJCWkrKzsKCX0KCXRlbXA9cFtqXTsKCXBbal09cFtsb3ddOwoJcFtsb3ddPXRlbXA7Cglxc29ydGZpcnN0KHAsbG93LGotMSk7Cglxc29ydGZpcnN0KHAsaisxLHVwKTsKfQoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglwYWlyPGludCxpbnQ+IHBbNV07Cglmb3IoaW50IGk9MDtpPDU7aSsrKQoJCWNpbj4+cFtpXS5maXJzdD4+cFtpXS5zZWNvbmQ7Cglmb3IoaW50IGk9MDtpPDU7aSsrKQoJCWNvdXQ8PHBbaV0uZmlyc3Q8PCIgIjw8cFtpXS5zZWNvbmQ7Cglxc29ydGZpcnN0KHAsMCw1KTsKCWZvcihpbnQgaT0wO2k8NTtpKyspCgkJY291dDw8cFtpXS5maXJzdDw8IiAiPDxwW2ldLnNlY29uZDsKCXJldHVybiAwOwp9Cg==