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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<" = "<<x<<"\n"
#define pb push_back
#define ins insert
#define fi first
#define se second
 
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.fi<<", "<<m.se<<")";
}
 
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void solve();
  
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t = 1;
//	cin>>t;
	while(t--) solve();
	return 0;
}
  


 
void solve(){
	int n;
	cin>>n;
	vector<pair<int,int> > lista;
	for(int i = 1; i <= n; i++){
		string s; int x;
		cin>>s>>x;
		if(s == "TAK"){
			lista.pb({i,x});
		}
	}
	int k = 0;
	int j = 0;
	while(k < 10){
		cout<<lista[j].fi<<" ";
		j++;
		k++;
	}
	while(k < 20){
		if(lista[j].se < 2){
			cout<<lista[j].fi<<" ";
			k++;
		}
		j++;
	}

 











}