#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) typedef long long ll; typedef pair<ll, ll> P; int main() { int N; cin>>N; vector<P> dan(N); FOR(i,0,N) { ll g, d; cin >> g >> d; dan[i] = P(g - 30000 * d, i + 1); } sort(dan.rbegin(), dan.rend()); if(dan[0].first*6 >= 3000000) { puts("YES"); FOR(i,0,6) { cout << dan[0].second << endl; } } else { puts("NO"); } return 0; }