#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP2(i,m,n) for (int i=m;i<(n);i++)
typedef long long ll;
typedef long double ld;

const int M = 10001;
typedef bitset<M> bs;

int N;
vector<int> A[101010];
vector<int> B[101010];
int ok[101010];


class SegmentTree {
public:
    vector<bs> table;
    int size;

    SegmentTree(int n) {
        size = 1;
        while (size <= n) size *= 2;
        size *= 2;
        table = vector<bs>(size);
    }

    void add(int pos, int num) {
        return add(pos, num, 0, 0, size/2-1);
    }

    void add(int pos, int num, int i, int left, int right) {
        if (left == right) {
            table[i][pos] = true;
            return;
        }
        int mid = (left + right) / 2;
        if (pos <= mid)
            add(pos, num, i*2+1, left, mid);
        else
            add(pos, num, i*2+2, mid+1, right);
        table[i] = table[i*2+1] | table[i*2+2];
    }

    bs query(int pl, int pr) {
        return query(pl, pr, 0, 0, size/2-1);
    }

    bs query(int pl, int pr, int i, int left, int right) {
        if (pl > right || pr < left)
            return bs(0);
        else if (pl <= left && right <= pr)
            return table[i];
        else
            return
                query(pl, pr, i*2+1, left, (left+right)/2) |
                query(pl, pr, i*2+2, (left+right)/2+1, right);
    }
};


void solve2(int x) {
    REP(i, N) B[i] = A[i];
    REP(i, N) swap(B[i][0], B[i][x]);
    sort(B, B+N);

    memset(ok, 0, sizeof(ok));
    SegmentTree st = SegmentTree(M);

    for (int i = N - 1, j = N - 1; i >= 0; --i) {
        while (j >= 0 && B[j][0] > B[i][0]) {
            st.add(B[j][1], B[j][2]);
            --j;
        }

        bs b = st.query(B[i][1], M);
        b >>= B[i][2];
        if (b.count()) ok[B[i][3]] = 1;
    }
}

void solve() {
    cin >> N;
    REP(i, N) {
        A[i] = vector<int>(4);
        REP(j, 3) cin >> A[i][j];
        A[i][3] = i;
    }

    solve2(0);
    solve2(1);
    solve2(2);
    REP(i, N) if (!ok[i]) cout << i+1 << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    solve();
}