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
#include <bits/stdc++.h>
//#include <cassert>

const int inf = 2e9;
const long long ill = 4e18;
const long long mod = 998244353;
const long double eps = 1e-6;

#define pii pair<int, int>
#define tui tuple<int, int, ll>
typedef long long ll;
typedef long double ld;

using namespace std;

void solve() {
	int n;
	cin >> n;
	vector<int> a;
	for (int i = 0; i < n; i++) {
		string s;
		int x;
		cin >> s >> x;
		if (s == "TAK" && a.size() < 10) {
			a.push_back(i + 1);
		}
		else if (a.size() >= 10 && a.size() < 20 && s == "TAK" && x < 2)
			a.push_back(i + 1);
	}
	for (int i = 0; i < 20; i++)
		cout << a[i] << ' ';
	cout << '\n';
	
}

signed main() {
	ios_base::sync_with_stdio(0);
	int t = 1;
	//cin >> t;
	while (t--)
		solve();


}