#include <cstdio>
#include <map>
#include <string>
#include <string.h>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <limits.h>
using namespace std;

struct stu{
  int id;
  int score;
};

stu student[1000005];

bool compare(stu a,stu b){
  if(a.score!=b.score){
    return a.score<b.score;
  }else{
    return a.id<b.id;
  }
}

int main(){
  int num;
  while(scanf("%d",&num)!=EOF){
    int score;
    int temp;
    for(int i=0;i<num;i++){
      scanf("%d %d",&temp,&score);

      student[i].id=temp;
      student[i].score=score;
    }
    stable_sort(student,student+num,compare);
    for(int i=0;i<num;i++){
      printf("%d %d\n",student[i].id,student[i].score);
    }
  }

	return 0;
}