#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())




int main(){
	int n;
	vector<int> v;
	cin>>n;
	rep(i,n){
		int g,d;
		cin>>g>>d;
		if(30000*100<=6*(g-30000*d))v.push_back(i+1);
	}
	if(v.empty())cout<<"NO"<<endl;
	else{
		cout<<"YES"<<endl;
		srand(114514);
		rep(i,6)cout<<v[rand()%v.size()]<<endl;
	}
	return 0;
}