#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
void solve() {
int n;
cin >> n;
map<int, vector<tuple<int, bool, int> > > mp;
for (int i = 0; i < n; i++) {
int x, y;
string dir;
cin >> x >> y >> dir;
mp[x + y].push_back({x, dir[0] == 'S', i + 1});
}
vector<int> ans;
for (auto [sum, v] : mp) {
vector<int> c;
sort(all(v));
for (auto [x, ty, ind] : v) {
if (ty == 0) c.push_back(ind);
else {
if (c.empty()) ans.push_back(ind);
else c.pop_back();
}
}
for (int i : c) ans.push_back(i);
}
for (int i : ans) cout << i << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
int t = 1;
//cin >> t;
while(t--){
solve();
}
}
