Problem:
Score : 200 points

Problem Statement

You have decided to write a book introducing good restaurants.
There are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i.
No two restaurants have the same score.

You want to introduce the restaurants in the following order:

The restaurants are arranged in lexicographical order of the names of their cities.

If there are multiple restaurants in the same city, they are arranged in descending order of score.

Print the identification numbers of the restaurants in the order they are introduced in the book.

Constraints

1 ≤ N ≤ 100

S is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.

0 ≤ P_i ≤ 100

P_i is an integer.

P_i ≠ P_j (1 ≤ i < j ≤ N)

Input

Input is given from Standard Input in the following format:

N
S_1 P_1
:
S_N P_N

Output

Print N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.

Sample Input 1

6
khabarovsk 20
moscow 10
kazan 50
kazan 35
moscow 60
khabarovsk 40

Sample Output 1

3
4
6
1
5
2

The lexicographical order of the names of the three cities is kazan < khabarovsk < moscow. For each of these cities, the restaurants in it are introduced in descending order of score. Thus, the restaurants are introduced in the order 3,4,6,1,5,2.

Sample Input 2

10
yakutsk 10
yakutsk 20
yakutsk 30
yakutsk 40
yakutsk 50
yakutsk 60
yakutsk 70
yakutsk 80
yakutsk 90
yakutsk 100

Sample Output 2

10
9
8
7
6
5
4
3
2
1

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.*;

public class Main {

    static class Pair implements Comparable<Pair>{
        int count=0;
        int val=0;
        Pair(int x , int y){
            this.count = x;
            this.val = y;
        }
        @Override
        public int compareTo(Pair o) {
            return  o.count - this.count;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        TreeMap<String, PriorityQueue<Pair>> tm = new TreeMap<>();
        for (int i = 0; i < N; i++) {
            String c = sc.next();
            Integer p = sc.nextInt();
            if(!tm.containsKey(c)){
                PriorityQueue<Pair> pq = new PriorityQueue<>();
                pq.add(new Pair(p,i));
                tm.put(c,pq);
            }else{
                PriorityQueue<Pair> pq = tm.get(c);
                pq.add(new Pair(p,i));
            }
        }

        for(Map.Entry<String, PriorityQueue<Pair>> e: tm.entrySet()){
            PriorityQueue<Pair> pq = e.getValue();
            while(!pq.isEmpty()){
                Pair pair = pq.poll();
//                System.out.println(e.getKey() +" "+ (pair.count)+" "+  (pair.val+1));
                System.out.println( (pair.val+1));
            }
        }
    }
}