#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

int hoge(const std::vector<std::pair<int, int>>& X) {
  int res = 0;
  for (size_t i = 0; i < 6; ++i)
    res += X[i%X.size()].first;
  return res;
}

int main() {
  size_t N;
  scanf("%zu", &N);

  std::vector<std::pair<int, int>> X(N);
  for (size_t i = 0; i < N; ++i) {
    int G, D;
    scanf("%d %d", &G, &D);
    X[i] = {G - 30000*D, i+1};
  }

  std::sort(X.rbegin(), X.rend());
  if (N > 6) X.resize(6);
  const int REQ = 30000*100;
  if (X[0].first*6 < REQ)
    return puts("NO"), 0;

  puts("YES");
  for (size_t i = X.size(); i--;) {
    if (hoge(X) >= REQ) {
      for (size_t j = 0; j < 6; ++j)
        printf("%d\n", X[j%X.size()].second);
      break;
    }
    X.pop_back();
  }
}