#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
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;

ll G[1005], D[1005];

struct ST {
  int i;
  ll val;
};
bool operator<(const ST& a, const ST& b){
  return a.val > b.val;
}

int main(){
  int N;
  cin >> N;
  vector<ST> v;
  rep(i,N){
    cin >> G[i] >> D[i];
    v.push_back((ST){i+1, G[i]-30000*D[i]});
  }
  sort(ALLOF(v));

  if(6*v[0].val >= 3000000LL){
    cout << "YES" << endl;
    rep(i,6){
      cout << v[0].i << endl;
    }
  }else{
    cout << "NO" << endl;
  }
  return 0;
}