1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1000'007;

void Solve()
{
    int n;
    string s; int x;
    vector<int> ans;
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> s >> x;
        if(s[0] == 'N' || (int)ans.size() >= 20) continue;
        if((int)ans.size() < 10 || x < 2)
            ans.pb(i);
    }
    for(int i = 0; i < (int)ans.size(); ++i)
        cout << ans[i] << " ";
    cout << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}