#include<stdio.h>
#include<stdlib.h>
#include<stdint.h>
#include<inttypes.h>
#include<string.h>

typedef int32_t i32;
typedef uint64_t u64;

typedef u64 radix_type;

#define RADIX_WIDTH 15
const uint32_t radix_type_max = 60;
const uint32_t radix_type_begin = 0;
const uint32_t radix_width = RADIX_WIDTH;
const uint32_t radix_mask = (1 << RADIX_WIDTH) - 1;
#undef RADIX_WIDTH

static inline uint32_t radix_get_bit (radix_type v, uint32_t shift) {
  return v >> shift & radix_mask;
}

void radix_sort (radix_type *a, uint32_t n) {
  radix_type * const array = (radix_type *) calloc (4 * n, sizeof (radix_type));
  radix_type **bucket = (radix_type **) calloc (1 << radix_width, sizeof (radix_type *));
  uint32_t *len = (uint32_t *) calloc (2 << radix_width, sizeof (uint32_t));
  uint32_t *max_len = len + (1 << radix_width);
  for (uint32_t shift = radix_type_begin; shift < radix_type_max; shift += radix_width) {
    radix_type *p = array;
    memset (len, 0, sizeof (uint32_t) << (radix_width + 1));
    for (uint32_t i = 0; i < n; ++i) {
      uint32_t bit = radix_get_bit (a[i], shift);
      if (len[bit] == max_len[bit]) {
        for (uint32_t j = 0; j < len[bit]; ++j) {
          p[j] = bucket[bit][j];
        }
        max_len[bit] = 2 * max_len[bit] + 1;
        bucket[bit] = p;
        p += max_len[bit];
      }
      bucket[bit][len[bit]++] = a[i];
    }
    for (uint32_t bit = 0, i = 0; bit < (1 << radix_width); ++bit) {
      for (uint32_t j = 0; j < len[bit]; ++j, ++i) {
        a[i] = bucket[bit][j];
      }
    }
  }
  free (array);
  free (bucket);
  free (len);
}

i32 max (i32 a, i32 b) {
  return a > b ? a : b;
}

void update (i32 *bit, i32 x, i32 v) {
  i32 n = bit[0];
  for (i32 i = x; i <= n; i += i & -i) {
    bit[i] = max (bit[i], v);
  }
}

i32 find (i32 *bit, i32 x) {
  i32 res = 0;
  for (i32 i = x; i > 0; i -= i & -i) {
    res = max (res, bit[i]);
  }
  return res;
}

void run (void) {
  i32 n;
  scanf ("%" SCNi32, &n);
  u64 *p = (u64 *) calloc (n, sizeof (u64));
  for (i32 i = 0; i < n; ++i) {
    i32 a, b, c;
    scanf ("%" SCNi32 "%" SCNi32 "%" SCNi32, &a, &b, &c);
    a++; b++; c++;
    p[i] = ((u64) a << 45) + ((u64) b << 31) + ((u64) c << 17) + i;
  }
  radix_sort (p, n);
  uint8_t *ok = (uint8_t *) calloc (n, sizeof (uint8_t));
  const i32 m = 10000 + 1;
  i32 *bit = (i32 *) calloc (m + 1, sizeof (i32));
  bit[0] = m;
  for (i32 i = n - 1; i >= 0; --i) {
    i32 b = (p[i] >> 31) & ((1 << 14) - 1);
    i32 c = (p[i] >> 17) & ((1 << 14) - 1);
    i32 index = p[i] & ((1 << 17) - 1);
    i32 k = m + 1 - b;
    if (find (bit, k) >= c) continue;
    ok[index] = 1;
    update (bit, k, c);
  }
  for (i32 i = 0; i < n; ++i) {
    if (ok[i]) {
      printf ("%" PRIi32 "\n", i + 1);
    }
  }
}

int main (void) {
  run();
  return 0;
}