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
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#define pr pair
#define f first
#define s second
#define ll long long
#define mp make_pair
#define pll pr<ll,ll>
#define pii pr<int,int>
#define piii pr<int,pii>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(0);
	int n;
	cin>>n;
	vector<int> ans;
	string s;
	int c;
	for(int i=1;i<=n;i++)
	{
		cin>>s>>c;
		if(s=="NIE") continue;
		if(c>=2&&ans.size()>=10) continue;
		if(ans.size()==20) continue;
		ans.push_back(i);
	}
	for(int i:ans) cout<<i<<' ';
	cout<<endl;
	return 0;
}