// Example of custom sorting of persons
// First increasingly by age and in case of tie be alphabetical order
// ----------------------------------
// Pedro Ribeiro (DCC/FCUP) - 04/10/2019
// ----------------------------------

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

// Type to store a person
typedef struct {
  int age;
  string name;
} Person;

// This function compares two elements of an array (needed for sort)
// It should return:
//  - true if  p1" is smaller than "p2"
//  - false otherwise
struct comparePerson {
  bool operator()(const Person p1, const Person p2) {
    if (p1.age < p2.age) return true;
    if (p1.age > p2.age) return false;
    return p1.name.compare(p2.name)<0;
  }
};

int main() {
  int n;

  cin >> n;
  Person v[n];

  for (int i=0; i<n; i++)
    cin >> v[i].age >> v[i].name;

  sort(v, v+n, comparePerson());
  
  for (int i=0; i<n; i++)
    cout << v[i].age << " " << v[i].name << endl;
  
  return 0;
}