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

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 10010;

int n, tot, p[maxn], cnt[maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  rep (i, 1, n) {
    string op;
    int c;
    cin >> op >> c;
    if (op == "TAK") p[++tot] = i, cnt[tot] = c;
  }
  rep (i, 1, 10) cout << p[i] << " ";
  int rest = 10;
  rep (i, 11, tot) if (cnt[i] <= 1 && rest) rest--, cout << p[i] << " ";
  cout << '\n';
}