#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

const long long exp_ = 30000 * 100;
const long long pena = 30000;

int main(){
	int n;
	cin >> n;
	vector<long long> G(n), D(n);
	vector<long long> E(n);
	for(int i=0; i<n; i++){
		cin >> G[i] >> D[i];
		E[i] = G[i] - D[i] * pena;
	}
	auto e = max_element(E.begin(), E.end());
	if(*e*6 > exp_){
		cout << "YES" << endl;
		for(int i=0; i<6; i++) cout << (e - E.begin()) + 1 << endl;
	}else{
		cout << "NO" << endl;
	}

	return 0;
}