#include #define MAX_N 100001 #define INF_INT 2147483647 #define INF_LL 9223372036854775807 #define REP(i,n) for(int i=0;i<(int)(n);i++) using namespace std; typedef long long int ll; typedef pair P; void init(int n); int find(int n); void unite(int x,int y); bool same(int x, int y); ll bpow(ll,ll,ll); typedef vector vec; typedef vector mat; mat mul(mat &A,mat &B); mat pow(mat A,ll n); int dx[4] = {1,0,0,-1}; int dy[4] = {0,1,-1,0}; bool cmp_P(const P &a,const P &b){ return a.second < b.second; } ll gcd(ll a,ll b){ if(b == 0)return a; else return gcd(b,a%b); } int main() { ll N,G[1001],D[1001],M=0,ind=0; cin >> N; REP(i,N)cin >> G[i] >> D[i]; REP(i,N){ M = max(M,G[i]-30000*D[i]); if(M == G[i]-30000*D[i]) ind = i; } if(6*M >= 3000000){ cout << "YES" << endl; REP(i,6) cout << (ind+1) << endl; }else cout << "NO" << endl; return 0; }