#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=decltype(l)();(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os;
}
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) noexcept {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() noexcept { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) noexcept {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) noexcept { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


using Vi4 = array<int, 4>;


int N, n;
Vi4 A[100010];
Vi4 tt[100010];

bool ng[100010];

int main() {

    scanner >> N;

    repeat(i, N) {
        int a, b, c;
        scanner >> a >> b >> c;
        A[i] = { a,b,c,i };
    }
    sort(A, A + N);
    n = distance(A, unique(A, A + N, [](Vi4& va, Vi4& vb) {return va[0] == vb[0] && va[1] == vb[1] && va[2] == vb[2]; }));

    // vector<int> perm(3);
    // iota(ALL(perm), 0);
    // 
    // do {
    // 
    //     repeat(i, n) {
    //         tt[i][0] = A[i][perm[0]];
    //         tt[i][1] = A[i][perm[1]];
    //         tt[i][2] = A[i][perm[2]];
    //         tt[i][3] = A[i][3];
    //     }
    // 
    //     sort(tt, tt + n);
    // 
    //     rrepeat(i, n - 1) {
    //         if (tt[i][0] <= tt[i + 1][0] &&
    //             tt[i][1] <= tt[i + 1][1] &&
    //             tt[i][2] <= tt[i + 1][2]
    //             )
    //             ng[tt[i][3]] = true;
    //     }
    // 
    // } while (next_permutation(ALL(perm)));
    
    sort(A, A+n, greater<Vi4>());
    
    rrepeat(i, n) {
        int a = A[i][0], b = A[i][1], c = A[i][2], d = A[i][3];
        bool f = false;
        int m = n/4*4;
        for(int j = 0; j < m; j += 4) {
            if (i != j && !ng[A[j][3]] && A[j][0] >= a && A[j][1] >= b && A[j][2] >= c) {
                f = true;
            }
            if (i != j+1 && !ng[A[j+1][3]] && A[j+1][0] >= a && A[j+1][1] >= b && A[j+1][2] >= c) {
                f = true;
            }
            if (i != j+2 && !ng[A[j+2][3]] && A[j+2][0] >= a && A[j+2][1] >= b && A[j+2][2] >= c) {
                f = true;
            }
            if (i != j+3 && !ng[A[j+3][3]] && A[j+3][0] >= a && A[j+3][1] >= b && A[j+3][2] >= c) {
                f = true;
            }
        }
        for(int j = n/4*4; j < n; ++j) {
            if (i != j && !ng[A[j][3]] && A[j][0] >= a && A[j][1] >= b && A[j][2] >= c) {
                f = true;
            }
        }
        ng[d] = f;
    }

    repeat(i, n) {
        if (!ng[i])
            printer << (i + 1) << '\n';
    }

    return 0;
}