#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#include<vector>
#include<functional>
#include<limits>
template<typename T>
struct segtree{
	using F=function<T(T,T)>;
	const F calcfn,updatefn;
	int n;
	T defvalue;
	vector<T>dat;
	segtree(int n_=0,T defvalue_=numeric_limits<T>::max(),
		const F calcfn_=[](T a,T b){return a<b?a:b;},
		const F updatefn_=[](T a,T b){return b;}
	):defvalue(defvalue_),calcfn(calcfn_),updatefn(updatefn_)
	{
		n=1;
		while(n<n_)n<<=1;
		dat.assign(2*n-1,defvalue);
	}
	void copy(const vector<T>&v)
	{
		for(int i=0;i<v.size();i++)dat[i+n-1]=v[i];
		for(int i=n-2;i>=0;i--)dat[i]=calcfn(dat[i*2+1],dat[i*2+2]);
	}
	void update(int i,T a)
	{
		i+=n-1;
		dat[i]=updatefn(dat[i],a);
		while(i>0)
		{
			i=(i-1)/2;
			dat[i]=calcfn(dat[2*i+1],dat[2*i+2]);
		}
	}
	T query(int a,int b)//[a,b)
	{
		int L=(a<0?0:a>n?n:a)+n-1;
		int R=(b<0?0:b>n?n:b)+n-1;
		T lret=defvalue,rret=defvalue;
		for(;L<R;L>>=1,R>>=1)
		{
			if(!(L&1))lret=calcfn(lret,dat[L]);
			if(!(R&1))rret=calcfn(dat[--R],rret);
		}
		return calcfn(lret,rret);
	}
};
int N;
bool out[1<<17];
main()
{
	cin>>N;
	vector<pair<pair<int,int>,pair<int,int> > >A(N);
	for(int i=0;i<N;i++)
	{
		cin>>A[i].first.first>>A[i].first.second>>A[i].second.first;
		A[i].second.second=i;
	}
	sort(A.begin(),A.end());
	reverse(A.begin(),A.end());
	segtree<int>P(10001,-1,[](int a,int b){return a<b?b:a;},[](int a,int b){return a<b?b:a;});
	for(pair<pair<int,int>,pair<int,int> >p:A)
	{
		int id=p.first.second,k=p.second.first;
		if(P.query(id,10001)>=k)out[p.second.second]=true;
		P.update(id,k);
	}
	for(int i=0;i<N;i++)if(!out[i])cout<<i+1<<endl;
}