#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main(){
	lint n,g,d,MAX=0,ans=0;
	cin>>n;
	vli data(n,0);
	rep(i,0,n){
		cin>>g>>d;
		if(MAX<g-30000*d){
			MAX=g-30000*d;
			ans=i+1;
		}
	}
	if(MAX*6>=3000000){
		o("YES");
		rep(i,0,6){
			o(ans);
		}
	}else{
		o("NO");
	}

}