#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<P, int> Pi;
int main()
{
	int n;
	cin>>n;
	vector<int> v[10001], vt[10001], vr[10001];
	int t[100000], r[100000];
	for(int i=0; i<n; i++){
		int p; scanf("%d %d %d", &p, &t[i], &r[i]);
		vt[t[i]].push_back(i);
		vr[r[i]].push_back(i);
		v[p].push_back(i);
	}
	bitset<100000> bt[10002], br[10002], bp;
	for(int i=10000; i>=0; i--){
		bt[i]=bt[i+1], br[i]=br[i+1];
		for(auto j:vt[i]){
			bt[i][j]=1;
		}
		for(auto j:vr[i]){
			br[i][j]=1;
		}
	}
	bool nuee[100001]={};
	for(int i=10000; i>=0; i--){
		for(auto j:v[i]){
			if((bp&bt[t[j]]&br[r[j]]).count()) nuee[j]=1;
		}
		for(auto j:v[i]) bp[j]=1;
		vector<Pi> v0;
		for(auto j:v[i]){
			if(nuee[j]) continue;
			v0.push_back({{t[j], r[j]}, j});
		}
		sort(v0.begin(), v0.end());
		int prt=-1, mx=-1;
		for(int j=v0.size()-1; j>=0; j--){
			if(prt==v0[j].first.first){
				nuee[v0[j].second]=1;
				mx=max(v0[j].first.second, mx);
			}else{
				prt=v0[j].first.first;
				if(v0[j].first.second<=mx){
					nuee[v0[j].second]=1;
				}
				mx=max(v0[j].first.second, mx);
			}
		}
		/*for(auto j:v[i]){
		    if(nuee[j]) continue;
			if((bp&bt[t[j]+1]&br[r[j]]).count()) nuee[j]=1;
			else if((bp&bt[t[j]]&br[r[j]+1]).count()) nuee[j]=1;
		}*/
	}
	for(int i=0; i<n; i++){
		if(!nuee[i]) printf("%d\n", i+1);
	}
	return 0;
}