#include<bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl

struct Dungeon{
    ll exp;
    ll id;
    Dungeon(){}
    Dungeon(ll e, ll i){
        exp = e;
        id = i;
    }
    bool operator<(const Dungeon &another) const{
        return exp < another.exp;
    }
    bool operator>(const Dungeon &another) const{
        return exp > another.exp;
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    vector<Dungeon> A;
    FOR(i, 0, N){
        ll g, d; cin >> g >> d;
        ll exp = g - 30000 * d;
        A.push_back(Dungeon(exp, i));
    }
    sort(ALL(A), greater<Dungeon>());

    if(A[0].exp * 6 >= 3000000){
        p("YES");
    }else{
        p("NO"); return 0;
    }

    FOR(i, 0, 6){
        p(A[0].id + 1);
    }
    
    return 0;
}