#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int n; cin >> n; int g[n], d[n]; rep(i,n)cin >> g[i] >> d[i]; rep(i,n){ int tmp = g[i] - d[i] * 30000; if(tmp >= 500000){ cout << "YES" << endl; rep(j,6){ cout << i + 1 << endl; } return 0; } } cout << "NO" << endl; return 0; }