#include <bits/stdc++.h>

using namespace std;
#pragma GCC optimize("Ofast")

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 5000 + 10;
const int M = 1e5 + 10;
int mod = 998244353;
const int infi = INT_MAX;
const ll infl = 1e16;
const int P = 2;

int mult(int a, int b){
    return a * 1LL * b % mod;
}

int sum(int a, int b){
    if(a + b >= mod)
        return a + b - mod;
    if(a + b < 0)
        return a + b + mod;
    return a + b;
}

int binpow(int a, int n){
    if (n == 0)
        return 1;
    if (n % 2 == 1){
        return mult(binpow(a, n - 1), a);
    }
    else{
        auto b = binpow(a, n / 2);
        return mult(b, b);
    }
}

int n, x[N], y[N], dead[N];
char d[N];

void solve(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> y[i] >> d[i];
    }
    vector<pair<int, pii>> col = {};
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(i == j) continue;
            if(d[i] == 'W' && d[j] == 'N'){
                if(x[i] - x[j] == y[j] - y[i] && x[i] - x[j] > 0){
                    col.pb({x[i] - x[j], {i, j}});
                }
            }else if(d[i] == 'W' && d[j] == 'S'){
                if(x[i] - x[j] == y[i] - y[j] && x[i] - x[j] > 0){
                    col.pb({x[i] - x[j], {i, j}});
                }
            }else if(d[i] == 'E' && d[j] == 'N'){
                if(x[j] - x[i] == y[j] - y[i] && x[j] - x[i] > 0){
                    col.pb({x[j] - x[i], {i, j}});
                }
            }else if(d[i] == 'E' && d[j] == 'S'){
                if(x[j] - x[i] == y[i] - y[j] && x[j] - x[i] > 0){
                    col.pb({x[j] - x[i], {i, j}});
                }
            }else if(d[i] == 'N' && d[j] == 'S' && y[i] - y[j] > 0){
                col.pb({(y[i] / y[j]) / 2, {i, j}});
            }else if(d[i] == 'E' && d[j] == 'W' && x[j] - x[i] > 0){
                col.pb({(x[j] - x[i]) / 2, {i, j}});
            }
        }
    }
    for(int i = 1; i <= n; i++)
        dead[i] = infi;
    sort(all(col));
    for(auto e : col){
        if(dead[e.S.F] < e.F || dead[e.S.S] < e.F) continue;
        dead[e.S.F] = e.F;
        dead[e.S.S] = e.F;
    }
    vector<int> ans = {};
    for(int i = 1; i <= n; i++)
        if(dead[i] == infi)
            ans.pb(i);
    for(auto e : ans){
        cout << e << '\n';
    }
}

signed main(){
    mispertion;
    int t = 1;
    //cin >> t;
    while (t--){
        solve();
    }
    return 0;
}