#include<stdio.h>
int sum_exp(int h,int h_exp[1001],int max_i[6])
{
	int i,sum=0;
	for(i=0;i<h;i++)
	{
		sum += h_exp[max_i[i]];
	}
	return sum;
}
int max_i_exp(int n,int exp[1001])
{
	int i,max,max_i=0;
	max=exp[0];
	for(i=0;i<n;i++)
	{
		if(exp[i]>max)
		{
			max = exp[i];
			max_i = i;
		}
	}
	return max_i;
}
int main (void)
{
	int n,g[1001],d[1001],i,h_exp[1001],h_exp_c[1001],h=6,d_exp=30000,j=0,sum=0,max_i[6];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&g[i]);
		scanf("%d",&d[i]);
		h_exp[i] = g[i] - (d_exp * d[i]);
		h_exp_c[i]=h_exp[i];
	}
	for(i=0;i<h;i++)
	{
		max_i[i] = max_i_exp(n,h_exp_c);
		h_exp_c[max_i[i]]-=1000000;
	}
	if((h_exp[max_i[0]]*h)>=d_exp*100)
	{
		printf("YES\n");
		sum = sum_exp(h,h_exp,max_i);		
		while(sum<=d_exp*100&&j<3)
		{
			max_i[5-j]=max_i[j];
			j++;
			sum = sum_exp(h,h_exp,max_i);
		}
		j=0;
		while(sum<=d_exp*100&&j<2)
		{
			max_i[2+j]=max_i[j];
			j++;
			sum = sum_exp(h,h_exp,max_i);
		}
		j=0;
		while(sum<=d_exp*100&&j<6)
		{
			max_i[j]=max_i[0];
			j++;
			sum = sum_exp(n,h_exp,max_i);
		}
		for(i=0;i<h;i++)
		{
			printf("%d\n",(max_i[i]+1));
		}
	}
	else
	{
		printf("NO\n");
	}
	return 0;
}