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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define imie(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
const int mod=1e9+7;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    int n;
    cin >> n;
    vector<int> v;
    for(int i = 1; i <= n; i++) {
        if(v.size() == 20) break;
        string s;
        cin >> s;
        int k;
        cin >> k;
        if(s == "NIE") continue;
        else {
            if(v.size() < 10) {
                v.push_back(i);
            }
            else if(v.size() >= 10 && k < 2) {
                v.push_back(i);
            }
        }
    }
    for(auto i : v) {
        cout << i << ' ';
    }
    return 0;
}