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

using namespace std;

#define _DEBUG
#ifdef _DEBUG
template<typename T1, typename T2> auto& operator<<(ostream& o, pair<T1, T2> a) { return o << "(" << a.first << ", " << a.second << ")"; }
template<typename T, typename OS> auto& operator<<(OS& o, T a) { o << "{"; for(auto b : a) o << b << ", "; return o << "}"; }
#define dbg(x...) cerr << "[" #x "]: ", [](auto... args) { ((cerr << args << ", "),...) << "\n"; }(x)
#else
#define dbg(...)
#endif

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define F first
#define S second

using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using vi = vector<int>;

void solve() {
  int n;
  cin >> n;
  vector<int> vs;
  vs.reserve(n);
  vector<int> ws;
  for(int i = 1; i <= n; i++) {
    string str;
    int w;
    cin >> str >> w;
    if(str == "TAK") {
      vs.push_back(i);
      ws.push_back(w);
    }    
  }

  for(int i = 0; i < 10; i++) {
    cout << vs[i] << " ";
  }
  int done = 0;
  for(int i = 10; i < vs.size(); i++) {    
    if(ws[i] < 2) {
      cout << vs[i] << " ";
      done++;
    }
    if(done == 10) {
      break;
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  solve();
  return 0;
}