#include <iostream>
#include <ctime>
#include <stack>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void rand(int *a, int n) {
	for (int i = 0; i < n; i++) {
		a[i] = rand() % 100 - 50;
	}
}
void bubblesort(int* arr, int n) {
	bool swap1 = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n - 1; j++) {
			if (arr[j] < arr[j + 1]) {
				swap(arr[j + 1], arr[j]);
				swap1 = true;
			}
			if (!swap1)
				break;
		}
	}
}
void perevorot(int *a,int  n) {
	int arr1[1001];
	for (int i = 0; i < n; i++) {
		arr1[i] = a[i];
	}
	for (int i = 0; i < n; i++) {
		a[i] = arr1[n - i - 1];
	}
}
void print(int *a, int n) {
	for (int i = 0; i <n; i++)
		cout << a[i] << " ";
}
void cin_mass1(int*a, int n) {
	for (int i = 0; i <n; i++)
		cin >> a[i];
}
void cin_mass2(int**arr, int n,int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> arr[i][j];
		}
	}
}
int nod(int a, int b){
	while (a && b)
		if (a >= b)
			a %= b;
		else
			b %= a;
	return a | b;
}
/*int **arr = new int*[n];
for (int i = 0; i<n; i++) {
	int*arr = new int[n];
}
*/


int main() {
	int n;
	cin >> n;
	int arr[1000][2];
	for (int i = 0; i<n; i++) {
		for (int j = 0; j<2; j++) {
			cin >> arr[i][j];
		}
	}
	for (int i = 1; i < n; i++) {
		int ind = i;
		while (ind > 0 && (arr[ind - 1][1] > arr[ind][1])) {
			swap(arr[ind - 1][1], arr[ind][1]);
			swap(arr[ind - 1][0], arr[ind][0]);
			ind--;
		}
		while (ind > 0 && arr[ind - 1][1] == arr[ind][1]) {
			if (arr[ind - 1][0] < arr[ind][0]) {
				swap(arr[ind - 1][1], arr[ind][1]);
				swap(arr[ind - 1][0], arr[ind][0]);
			}
			ind--;
		}
	}
	for (int i = n - 1; i >= 0; i--) {
		cout << arr[i][0] << " " << arr[i][1] << endl;
	}
	return 0;
}