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

int n;
int g[1000], d[1000];

int main()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++){
		scanf("%d %d", g + i, d + i);
	}
	
	vector<pair<int, int>> v;
	for (int i = 0; i < n; i++){
		v.push_back(make_pair(g[i] - 30000 * d[i], i));
	}
	sort(begin(v), end(v), greater<pair<int, int>>());
	
	vector<int> res;
	for (int i = 1; i <= min(6, n); i++){
		vector<int> r;
		int e = 0;
		for (int j = 0; j < 6; j++){
			int p = j % i;
			e += v[p].first;
			r.push_back(v[p].second);
		}
		if (e >= 3000000) res = r;
	}
	
	if (res.size() == 0) puts("NO");
	else {
		puts("YES");
		for (int i = 0; i < 6; i++){
			printf("%d\n", res[i] + 1);
		}
	}
}