#include <bits/stdc++.h>
using namespace std;

int main()
{
	int N;
	cin >> N;
	vector<long long> G( N );
	vector<long long> D( N );
	for( int i = 0; i < N; i++ ) {
		cin >> G[i] >> D[i];
	}

	typedef pair<long long, int> P;
	vector<P> p( N );
	for( int i = 0; i < N; i++ ) {
		p[i] = P( G[i] - D[i] * 30000, i );
	}
	sort( p.begin(), p.end(), greater<P>() );

	long long t = 30000 * 100;
	if( p[0].first * 6 < t ) cout << "NO" << endl;
	else {
		cout << "YES" << endl;
		for( int i = 0; i < 6; i++ ) {
			cout << p[0].second + 1 << endl;
		}
	}
}