n = int(input())
velo = [(i, 0) for i in range(1, n + 1)]
maxi = 0
max_num = 1
for i in range(n):
    g, d = [int(x) for x in input().split()]
    velo[i] = (i + 1, g - 30000 * d)

velo.sort(key=lambda p: p[1])
best = velo[-6:]
best += [best[-1]] * (6 - len(best))
if best[-1][1] * 6 >= 3 * 10 ** 6:
    for i in range(len(best)):
        if sum([p[1] for p in best]) >= 3 * 10 ** 6:
            break
        best[i] = best[-1]
    print('YES')
    print(*[p[0] for p in best], sep='\n')
else:
    print('NO')