def countSort(arr):
    for i in range(len(arr)//2):
        arr[i][1] = '-'
    arr.sort(key=lambda x: int(x[0]))
    [print(c[1], end=' ') for c in arr]

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] numbers = new int[n];
        int[] counter = new int[100];
        String[] s = new String[n];
        String[] orderedS = new String[n];
        StringBuilder out = new StringBuilder();
        for (int i = 0; i < n; i++) {
            numbers[i] = sc.nextInt();
            counter[numbers[i]]++;
            s[i] = sc.next();
        }

        for (int i = 1; i < 100; i++) { counter[i] += counter[i-1]; }

        for (int i = (n-1); i >= 0; i--) {
            if (i < n/2) {
                orderedS[counter[numbers[i]] - 1] = "-";
            } else {
                orderedS[counter[numbers[i]] - 1] = s[i];
            }
            counter[numbers[i]] -= 1;
        }

        for (int i = 0; i < n; i++) {
            out.append(orderedS[i] + " ");
        }

        System.out.print(out);
    }
}

def count_sort_internal(a: list) -> list[str]:
    '''
    According to the examples online, this is how the 
    midpoint is calculated. The function is allowed
    to be destructive. 100 is the (exclusive) limit
    to the key.
    '''
    buckets = [[] for _ in range(100)]
    midpoint = len(a) // 2
    for i in range(midpoint):
        a[i][1] = '-'
    for i, (k, s) in enumerate(a):
        buckets[int(k)].append('-' if i < midpoint else s)
    result = [s for bucket in buckets for s in bucket]
    return result

# pylint: disable=C0103,C0116
def countSort(a: list):
    result = count_sort_internal(a)
    for i, s in enumerate(result):
        if i > 0:
            print(' ', end='')
        print(s, end='')

def countSort(arr):
    ans = [[] for _ in range(n)]
    for i in range(len(arr) // 2):
        ans[int(arr[i][0])].append("-")
    for i in range(len(arr) // 2, len(arr)):
        ans[int(arr[i][0])].append(arr[i][1])
    print(" ".join(" ".join(i) for i in ans).strip())

def countSort(arr):
    
    size = len(arr)
    mid = (size - 1)//2
    
    # Replace first half
    for k in range(mid+1):
      arr[k][1] = '-'
      
    # Sort based on x[0]
    sort = sorted(arr, key = lambda x: x[0]) 
    # Print results
    for s in sort:
      print(s[1],end = ' ')