#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()

using namespace std;
typedef long long ll;

int N, G[1010], D[1010], P[1010];

int prof(int i) {
  return G[i] - 30000 * D[i];
}

bool comp(int i, int j) {
  return prof(i) > prof(j);
}

int main(int argc, char *argv[])
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> N;
  REP(i, N) cin >> G[i] >> D[i];
  REP(i, N) P[i] = i;
  sort(P, P + N, comp);
  if (prof(P[0]) * 6 < 3000000) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  REP(i,6) cout << P[0]+1 << endl;

  return 0;
}