#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <list>
#include <map>
#include <set>


using namespace std;

typedef long long ll;

int G[1001], D[1001], ex[1001];
int tar = 3000000;

int main()
{
    int N;
    cin >> N;
    int curMax = 0;
    for(int i=0; i<N; i++){
        cin >> G[i] >> D[i];
        ex[i] = G[i] - 30000*D[i];
        if(ex[i] > curMax)
            curMax = ex[i];
    }


    if (curMax * 6 < tar){
        cout << "NO" << endl;
    }else{
        cout << "YES" << endl;
        vector<int> idx;
        for(int i=0; i<N; i++){
            if(ex[i] == curMax){
                idx.push_back(i+1);
            }
        }
        for(int i=0; i<6; i++)    {
            cout << idx[i%idx.size()] << endl;
        }
    }




    return 0;
}