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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x),end(x)
#define pb push_back
#define st first
#define nd second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int INF = 2e9;
const ll LLINF = 2e18;

struct participant
{
    string s;
    int x;
};

void solve()
{
    int n;
    cin>>n;
    vector<participant> v(n);
    for(auto& p:v)
        cin>>p.s>>p.x;
    int cnt=0;
    for(int i=0; i<n; ++i)
    {
        if(v[i].s=="NIE")
            continue;
        if(cnt<10 || v[i].x<2)
        {
            cout<<i+1<<" ";
            ++cnt;
        }
        if(cnt==20)
            break;
    }
    cout<<endl;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int z=1;
    //cin>>z;
    while(z--)
        solve();
    return 0;
}