#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
using node = tuple<int, int, int>;
const int N = 2e5 + 10;

int n, x[N], y[N], z[N];
char dir[N];

bool crashed[N];

/*  
    0: x
    1: y
    2: x + y
    3: x - y
    0: N
    4: S
    8: W
    12: E
*/

int chg[256];

map<int, set<pii> > mp[16];

pii findCollide(int p) {
    pii ans = {INT_MAX, 0};
    if(dir[p] == 'E') {
        auto it = mp[0 ^ chg['W']][x[p]].lower_bound(pii{y[p], p});
        if(it != mp[0 ^ chg['W']][x[p]].end())
            ans = min(ans, pii{(it->first - y[p]) / 2, it->second});
        
        it = mp[2 ^ chg['N']][x[p] - y[p]].lower_bound(pii{x[p], p});
        if(it != mp[2 ^ chg['N']][x[p] - y[p]].end())
            ans = min(ans, pii{it->first - x[p], it->second});

        it = mp[3 ^ chg['S']][x[p] + y[p]].lower_bound(pii{x[p], p});
        if(it != mp[3 ^ chg['S']][x[p] + y[p]].begin()) {
            it --;
            ans = min(ans, pii{x[p] - it->first, it->second});
        }
    }else if(dir[p] == 'S') {
        auto it = mp[1 ^ chg['N']][y[p]].lower_bound(pii{x[p], p});
        if(it != mp[1 ^ chg['N']][y[p]].end())
            ans = min(ans, pii{(it->first - x[p]) / 2, it->second});
        
        it = mp[2 ^ chg['W']][x[p] - y[p]].lower_bound(pii{x[p], p});
        if(it != mp[2 ^ chg['W']][x[p] - y[p]].end())
            ans = min(ans, pii{it->first - x[p], it->second});

        it = mp[3 ^ chg['E']][x[p] + y[p]].lower_bound(pii{x[p], p});
        if(it != mp[3 ^ chg['E']][x[p] + y[p]].begin()) {
            it --;
            ans = min(ans, pii{x[p] - it->first, it->second});
        }
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    chg['S'] = 4;
    chg['W'] = 8;
    chg['E'] = 12;

    cin >> n;
    for(int i = 1; i <= n; i ++) {
        cin >> x[i] >> y[i] >> dir[i];
        z[i] = chg[dir[i]];
        mp[0 ^ z[i]][x[i]].insert({y[i], i});
        mp[1 ^ z[i]][y[i]].insert({x[i], i});
        mp[2 ^ z[i]][x[i] - y[i]].insert({x[i], i});
        mp[3 ^ z[i]][x[i] + y[i]].insert({x[i], i});
    }

    priority_queue<node, vector<node>, greater<node> > q;

    for(int i = 1; i <= n; i ++) {
        auto [t, b] = findCollide(i);
        //cout << "find " << i << " = " << t << ", " << b << endl;
        if(b) q.push({t, i, b});
    }

    while(q.size()) {
        auto [t, a, b] = q.top();
        q.pop();

        if(crashed[a] || crashed[b]) {
            if(!crashed[a]) {
                auto [t, b] = findCollide(a);
                if(b) q.push({t, a, b});
            }
            continue;
        }

        vector<pii> v;
        v.emplace_back(a, b);

        while(q.size() && get<0>(q.top()) == t) {
            auto [t, a, b] = q.top();
            q.pop();

            if(crashed[a] || crashed[b]) {
                if(!crashed[a]) {
                    auto [t, b] = findCollide(a);
                    if(b) q.push({t, a, b});
                }
                continue;
            }
            v.emplace_back(a, b);
        }

        for(auto [a, b] : v) {
            crashed[a] = crashed[b] = true;
            for(auto i : {a, b}) {
                mp[0 ^ z[i]][x[i]].erase({y[i], i});
                mp[1 ^ z[i]][y[i]].erase({x[i], i});
                mp[2 ^ z[i]][x[i] - y[i]].erase({x[i], i});
                mp[3 ^ z[i]][x[i] + y[i]].erase({x[i], i});
            }
            //cout << a << " and " << b << " crashed at " << t << "\n";
        }
    }

    for(int i = 1; i <= n; i ++)
        if(!crashed[i]) cout << i << " ";
    cout << "\n";
}