#include "bits/stdc++.h"
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long mod = 1e9 + 7;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

int main() {
	ll n;
	cin >> n;

	vector<ll> g(n);
	vector<ll> d(n);

	rep(i, n) {
		cin >> g[i] >> d[i];
	}

	rep(i, n) {
		ll m = g[i] * 6 - d[i] * 30000 * 6;
		if (m >= 3000000) {
			cout << "YES" << endl;
			rep(j, 6) {
				cout << i + 1 << endl;
			}
			return 0;
		}
	}

	cout << "NO" << endl;
}