#include <bits/stdc++.h>

using namespace std;
const int N = 110;
struct Node {
    int id;
    int score;
    const bool operator<(const Node &b) const {
        if (score == b.score) return id < b.id;
        return score > b.score;
    }
} a[N];
int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i].id >> a[i].score;
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++) printf("%d %d\n", a[i].id, a[i].score);

    return 0;
}