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

using namespace std;

ifstream fin("cmp.in");
ofstream fout("cmp.out");

struct point
{
	long long  x,y;
};

vector<point> v;
vector<int>::iterator it;

long long i;

bool compare(point a, point b)
{
	return (b.x>a.x);
}

/*
long long Divide_and_Conquer_Left(int st, int dr)
{
*/	
		
long long lin,col,n;	
point punct;
		
int main()

{	
	fin>>n;
	for(i=0;i<n;i++)
	{   
		fin>>punct.x>>punct.y;
		v.push_back(punct);
	}
	
	sort(v.begin(),v.end(),compare);
	for(i=0;i<n;i++)
		cout<<v[i].x<<' '<<v[i].y<<' '<<"\n";


	return 0;
}