#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
std::vector<int> A[3];
bool checked[100100];

struct SegmentTree{
    int numLeaf;
    std::vector<int> data;
    
    SegmentTree(int n){
        numLeaf = 1;
        while(numLeaf < n){
            numLeaf *= 2;
        }

        data.resize(numLeaf * 2);
        std::fill(data.begin(), data.end(), -1);
    }

    void set(int k, int v){
        k += numLeaf;
        data[k] = v;

        while(k > 1){
            k /= 2;
            data[k] = std::max(data[k*2], data[k*2+1]);
        }
    }

    int max(int l, int r){
        l += numLeaf;
        r += numLeaf;

        int res = -1;
        for(;l<r;l/=2,r/=2){
            if(l & 1){
                res = std::max(res, data[l]);
                l += 1;
            }
            if(r & 1){
                r -= 1;
                res = std::max(res, data[r]);
            }
        }

        return res;
    }

    int at(int i){
        return data[i + numLeaf];
    }
};
    
void f(int x, int y, int z){
    std::vector<int> indices(N);
    
    std::iota(indices.begin(), indices.end(), 0);
    std::sort(indices.begin(), indices.end(), [&](int i, int j){return A[x][i] < A[x][j];});
    std::reverse(indices.begin(), indices.end());

    SegmentTree seg(N);

    for(int i=0,j=0;i<N;i=j){
        while(j < N && A[x][indices[j]] == A[x][indices[i]]){
            j += 1;
        }

        for(int k=i;k<j;++k){
            int t = A[y][indices[k]], u = A[z][indices[k]];

            if(seg.max(t, N) >= u){
                checked[indices[k]] = 1;
            }
        }

        for(int k=i;k<j;++k){
            int t = A[y][indices[k]], u = A[z][indices[k]];

            seg.set(t, std::max(seg.at(t), u));
        }
    }
}

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

    std::cin >> N;

    for(int i=0;i<3;++i){
        A[i].resize(N);
    }

    for(int i=0;i<N;++i){
        std::cin >> A[0][i] >> A[1][i] >> A[2][i];
    }

    for(int i=0;i<3;++i){
        std::vector<int> v(A[i]);
        std::sort(v.begin(), v.end());
        v.erase(std::unique(v.begin(), v.end()), v.end());

        for(int j=0;j<N;++j){
            A[i][j] = std::lower_bound(v.begin(), v.end(), A[i][j]) - v.begin();
        }
    }

    f(0, 1, 2);
    f(1, 2, 0);
    f(2, 0, 1);

    for(int i=0;i<N;++i){
        if(!checked[i]){
            std::cout << (i + 1) << std::endl;
        }
    }
}