#include <algorithm>
#include <array>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include<complex>
#include <cmath>
#include <iostream>
#include <fstream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <string>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
//#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int comp(const void* a, const void* b)
{
    return *(int*)b - *(int*)a;
}

int hoge[1000][2];
int score[1000];
int main()
{
    int n;
    cin >> n;
    rep(i,n)
    {
        cin >> hoge[i][0] >> hoge[i][1];
        score[i] = hoge[i][0] - 30000 * hoge[i][1];
    }
    int temp = 0;
    int temp_score = -100;
    rep(i,n)
    {
        if (temp_score < score[i])
        {
            temp = i;
            temp_score = score[i];
        }
    }

    if (6 * score[temp] >= 30000*100)
    {
        cout << "YES" << endl;
        rep(i,6)
            cout << temp + 1 << endl;
    }else
    {
        cout << "NO" << endl;
    }
    return 0;

}