#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define reps(i,x) for(int i=1;i<=(int)(x);++i)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define rreps(i,x) for(int i=((int)(x));i>0;i--)
#define pb push_back

int n, g, d;

int vec_max(vi a){
    return *max_element(a.begin(), a.end());
}

int vec_index(vi a, int b) {
    return find(a.begin(), a.end(), b) - a.begin();
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    vi a(n);
    rep(i, n) {
        cin >> g >> d;
        a[i] = g - 30000*d;
    }
    int mx = vec_max(a), idx = vec_index(a, mx) + 1;
    if (mx*6 >= 30000*100) {
        cout << "YES" << "\n";
        rep(i, 6) cout << idx << "\n";
    } else {
        cout << "NO" << "\n";
    }
    return 0;
}