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
# include <bits/stdc++.h>
typedef long long ll;
using namespace std;
# define For(i , l , r) for(int i = (l); i <= (r); i++)
# define Rep(i , n) For(i , 0 , (n) - 1)
# define size(x) (ll)x.size()
# define all(x) x.begin(),x.end()
# define MAXN 200005
const ll inf = 1e9 + 7;
const ll mod = 998244353;
ll n , m , k , ans = 0 , qq;
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    vector<ll>vec1 , vec2;
    Rep (i , n) {
        string c;
        ll x;
        cin >> c >> x;
        if (c == "NIE") continue;
        if (size(vec1) < 10) vec1.push_back(i);
        else if (x < 2 && size(vec2) < 10) vec2.push_back(i);

    }
    Rep (i , size(vec1)) cout << vec1[i] + 1 << ' ';
    Rep (i , size(vec2)) cout << vec2[i] + 1 << ' ';
}
/*

*/