#include<iostream.h>
#include <algorithm>

using namespace std;


struct str
{
	int x;
	int y;
};
bool operator<(const str & a,const str & b)
{
	return (a.x<b.x)||(a.x==b.x && a.y<b.y);
}
int hole(int left, int right);
void sort1(int a, int b);

str a[6];

int main(){	
	int i;
	//sort1(0,5);

	for ( i = 0; i < 6; i++){
		a[i].x = 4;
		a[i].y = 6 - i;
	}
	
	sort(a,a+6);

	for ( i = 0; i < 6; i++){
		cout << a[i].x << " " << a[i].y <<endl;
	}
	cout << endl;
	return 0;
}		
/*
void sort1(int a, int b)
{
	if(a >= b) return;
	int k = hole(a,b);
	sort1(a,k-1) ;
	sort1(k+1,b);
}*/
/*
int hole(int left, int right){
	int b = a[left];
	while(left < right){
		while(a[right] >= b && left < right){
			right--;
		}
		if (left != right) {
			a[left] = a[right];

		}
		else {
			a[left] = b;
			return left;		
		}
		while(a[left] <= b && left < right){
			left++;
		}
		if(left != right){
			a[right] = a[left];
		}
		else {
			a[left] = b;
			return left;
		}
	}
	return 0;
}*/