#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
#include<set>
#include<bitset>
#include<math.h>
#include<map>
#include<queue>
#include<iomanip>
using namespace std;

int main(){
    int n, max1, m;
    cin >> n;
    vector<vector<int>> v(n, vector<int>(4));
    for (int i = 0; i < n; i++){
        v[i][1] = i+1;
        cin >> v[i][2] >> v[i][3];
        v[i][0] = v[i][2] - 30000 * v[i][3];
    }
    sort(v.begin(), v.end(), greater());
    m = v[0][0];
    if ((max1 = m*6) < 3000000) cout << "NO" << endl;
    else {
        cout << "YES" << endl;
        for (int i = 0; i < 6; i++){
            if (max1 - m + v[i%n][0] >= 3000000){
                cout << v[i%n][1] << endl;
                max1 -= (m - v[i%n][0]);
            }
            else cout << v[0][1] << endl;
        }
    }
}