from collections import deque
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)


N = int(input())
PQR = tuple(tuple(map(int, input().split())) for _ in range(N))
P, Q, R = zip(*PQR)

ptoi = {p: i for i, p in enumerate(sorted(set(P)))}
M = len(ptoi)
d = [[] for _ in range(M)]
for i, (p, q, r) in enumerate(PQR, 1):
    d[ptoi[p]].append((q, r, i))

for i in range(M):
    stack = []
    d[i].sort()
    for q, r, j in d[i]:
        if stack and stack[-1][1] <= r:
            stack.pop()
        stack.append((q, r, j))
    d[i] = stack
    d[i].reverse()


def merge(i, j):
    F = d[i]
    G = d[j]
    st0 = []
    st1 = []

    while F and G:
        if F[-1][0] <= G[-1][0]:
            st0.append(F.pop())
        else:
            while st0 and st0[-1][1] <= G[-1][1]:
                st0.pop()
            st1.append(G.pop())
    while F:
        st0.append(F.pop())
    while G:
        while st0 and st0[-1][1] <= G[-1][1]:
            st0.pop()
        st1.append(G.pop())

    st0.reverse()
    st1.reverse()
    while st0 and st1:
        if st0[-1][0] <= st1[-1][0]:
            d[i].append(st0.pop())
        else:
            d[i].append(st1.pop())
    while st0:
        d[i].append(st0.pop())
    while st1:
        d[i].append(st1.pop())
    d[i].reverse()


que = deque(range(M))
while len(que) > 1:
    a = que.popleft()
    b = que.popleft()
    if a > b:
        que.append(a)
        que.appendleft(b)
        continue
    merge(a, b)
    que.append(a)


ans = []
for _, _, i in d[0]:
    ans.append(i)
ans.sort()
print(*ans, sep="\n")