#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

  int n;
  cin >> n;

  vector<pii> vp;
  rep(i,0,n) {
    ll g, d;
    cin >> g >> d;
    vp.push_back(pii(i, g-30000*d));
  }

  sort(vp.begin(), vp.end(),greater<pii>());

  ll sum = 0;
  rep(i,0,6) sum += vp[0].second;

  if(sum > 30000 * 100) {
    cout << "YES" << endl;
    rep(i,0,6) cout << vp[0].first << endl;
  } else cout << "NO" << endl;

  return 0;
}