#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define debug(x) cout<<#x<<":"<<x<<endl

int N;
int G[1024],D[1024];
int W[1024];
int Need;

int main(){
    cin>>N;
    REP(i,N) cin>>G[i]>>D[i];
    REP(i,N) W[i]=G[i]-D[i]*30000;
    Need=30000*100;
    int mx=0;
    REP(i,N) mx=max(mx,W[i]);
    vector<int> num;
    REP(i,N){
        if(mx==W[i]){       
            num.push_back(i+1);
        }
    }
    if(mx*6<Need){
        cout<<"NO"<<endl;
    }else{
        cout<<"YES"<<endl;
        for(int i=0;i<6;i++){
            cout<<num[i]<<endl;
        }
    }
    return 0;
}