#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}



//0-indexed,2冪のセグメントツリー
template <class T>
struct SegTree {
    private:
    int n;// 葉の数
    vector<T> data;// データを格納するvector
    T def; // 初期値かつ単位元
    function<T(T, T)> operation; // 区間クエリで使う処理
    function<T(T, T)> change;// 点更新で使う処理

    T find(int a, int b) {
        T val_left = def, val_right = def;
        for (a += (n - 1), b += (n - 1); a < b; a >>= 1, b >>= 1)
        {
            if ((a & 1) == 0){
                val_left = operation(val_left, data[a]);
            }
            if ((b & 1) == 0){
                val_right = operation(data[--b],val_right);
            }
        }
        return operation(val_left, val_right);
    }
    public:
    // _n:必要サイズ, _def:初期値かつ単位元, _operation:クエリ関数,
    // _change:更新関数
    SegTree(size_t _n, T _def, function<T(T, T)> _operation,
        function<T(T, T)> _change=[](T a,T b){return b;})
        : def(_def), operation(_operation), change(_change) {
        n = 1;
        while (n < _n) {
            n *= 2;
        }
        data = vector<T>(2 * n - 1, def);
    }
    void set(int i, T x) { data[i + n - 1] = x; }
    void build() {
        for (int k=n-2;k>=0;k--) data[k] = operation(data[2*k+1],data[2*k+2]);
    }
    // 場所i(0-indexed)の値をxで更新
    void update(int i, T x) {
        i += n - 1;
        data[i] = change(data[i], x);
        while (i > 0) {
            i = (i - 1) / 2;
            data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
        }
    }
    T all_prod(){
      return data[0];
    }
    // [a, b)の区間クエリを実行
    T query(int a, int b) {
        //return _query(a, b, 0, 0, n);
        return find(a,b);
    }

    // 添字でアクセス
    T operator[](int i) {
        return data[i + n - 1];
    }
};

template <class T>
class Seg2D{
  int H=1,W=1;
  T def;
  function<T(T,T)> operation;
  function<T(T,T)> change;
  vector<ll> height;
  vector<vector<ll>> width;
  vector<SegTree<T>> st;
  public:
  Seg2D(vector<ll> x,vector<ll> y,T _def,function<T(T,T)> _operation,function<T(T,T)> _change){
    def=_def;
    operation=_operation;change=_change;
    height=x;sort(all(height));
    height.erase(unique(all(height)),height.end());
    while(H<height.size())H<<=1;
    width.resize(H*2-1);
    rep(i,x.size()){
      int idx=lower_bound(all(height),x[i])-height.begin();
      width[idx+H-1].emplace_back(y[i]);
    }
    for(int i=H-1;i<H*2-1;i++){
      sort(all(width[i]));
      width[i].erase(unique(all(width[i])),width[i].end());
    }
    for(int i=H-2;i>=0;i--){
      merge(all(width[i*2+1]),all(width[i*2+2]),back_inserter(width[i]));
      width[i].erase(unique(all(width[i])),width[i].end());
    }
    rep(i,H*2-1){
      //上位のセグメントは両方operationにしてる
      if(i<H-1){
        st.push_back(SegTree<T>(width[i].size(),_def,_operation,_operation));
      }
      else{
        st.push_back(SegTree<T>(width[i].size(),_def,_operation,_change));

      }
    }
  }
  void update(ll x,ll y,T val){
    ll idx=lower_bound(all(height),x)-height.begin();
    idx+=H-1;
    while(1){
      ll idy=lower_bound(all(width[idx]),y)-width[idx].begin();
      st[idx].update(idy,val);
      if(!idx)break;
      idx=(idx-1)/2;
    }
  }
  T query(ll _x1,ll _x2,ll _y1,ll _y2){
    int x1=lower_bound(all(height),_x1)-height.begin();
    int x2=lower_bound(all(height),_x2)-height.begin();
    T val_left=def,val_right=def;
    for(x1+=H-1,x2+=H-1;x1<x2;x1>>=1,x2>>=1){
      if((x1&1)==0){
        int y1=lower_bound(all(width[x1]),_y1)-width[x1].begin();
        int y2=lower_bound(all(width[x1]),_y2)-width[x1].begin();
        val_left=operation(val_left,st[x1].query(y1,y2));
      }
      if((x2&1)==0){
        x2--;
        int y1=lower_bound(all(width[x2]),_y1)-width[x2].begin();
        int y2=lower_bound(all(width[x2]),_y2)-width[x2].begin();
        val_right=operation(st[x2].query(y1,y2),val_right);
      }
    }
    return operation(val_left,val_right);
  }
};

int main(){
  ll n;cin >> n;
  vl x(n),y(n),z(n);
  rep(i,n)cin >> x[i] >> y[i] >> z[i];
  Seg2D<ll> st(x,y,-1,[](ll a,ll b){return max(a,b);},[](ll a,ll b){return b;});
  rep(i,n){
    st.update(x[i],y[i],z[i]);
  }
  rep(i,n){
    if(st.query(x[i],x[i]+1,y[i],y[i]+1)>z[i]){
      continue;
    }
    auto q=max(st.query(x[i]+1,inf,y[i],inf),st.query(x[i],inf,y[i]+1,inf));
    //cout << q <<"zzz" << endl;
    if(q<z[i]){
      cout << i+1 << endl;
    }
  }
}