#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=(int) n;i--)
#define p(s) cout<<(s)<<endl
#define DEBUG(x,y) cout<<#x<<": "<<x<<" , "<<#y<<": "<<y<<endl;
#define CK(n,a,b) ((a)<=(n)&&(n)<=(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod=1e9+7;

int main(){
	int N,G,D;
	cin>>N;
	int mx=0;
	int ans=0;
	REP(i,0,N){
		cin>>G>>D;
		if(mx<G-30000*D){
			mx=G-30000*D;
			ans=i+1;
		}

	}
	if(mx*6>=3000000) {
		p("YES");
		REP(i,0,6) p(ans);
	}
	else p("NO");
	return 0;
}