#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

int N;
ll G[1000], D[1000];
pair<ll, int> EXP[1000];

int main() {
    cin >> N;
    rep (i, N) cin >> G[i] >> D[i];
    rep (i, N) EXP[i] = make_pair(G[i] - 30000 * D[i], i + 1);

    sort(EXP, EXP + N);

    ll sum = EXP[N - 1].first * 6;

    if (sum >= 100 * 30000) {
        cout << "YES" << endl;
        rep (i, 6) cout << EXP[N - 1].second << endl;
    } else {
        cout << "NO" << endl;
    }
}