//~~~~~~~~~~~~~MJ®™~~~~~~~~~~~~~
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define ll long long
#define ln cout<<endl
#define int long long
#define Code ios_base::sync_with_stdio(0);
#define by cin.tie(NULL);
#define Hayan cout.tie(NULL);
#define append push_back
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define vi vector<int>
#define ret(x) {cout<<x;return;}
#define ui map<int,int>
#define pi pair<int,int>
#define ff first
#define ss second
using namespace std;
template <typename T> using v = vector<T>;
const int INF = 1e18, MOD = 1e9+7, N = 2e5+7;
struct ship
{
int x, y, p;
};
int canSink(const ship &a, const ship &b)
{
if (a.p==1)
{
if (b.p==2)
{
if (b.y==a.y and a.x<=b.x)
return (b.x-a.x)/2;
}
else if (b.p==3)
{
// cout <<"hayan"<<endl;
if (b.x-a.x == a.y-b.y)
return (b.x-a.x);
}
else if (b.p==4)
{
if (b.x-a.x == b.y-a.y)
{
return (b.x-a.x);
}
}
return -1;
}
else if (a.p==2)
{
if (b.p==1)
{
if (b.y==a.y and a.x>=b.x)
return (a.x-b.x)/2;
}
else if (b.p==3)
{
if (a.x-b.x == a.y-b.y)
return (a.x-b.x);
}
else if (b.p==4)
{
if (a.x-b.x == b.y-a.y)
return (a.x-b.x);
}
return -1;
}
else if (a.p==3)
{
if (b.p==4)
{
if (b.x==a.x and b.y>=a.y)
return (b.y-a.y)/2;
}
else if (b.p==2)
{
if (b.x-a.x == b.y-a.y)
return (b.y-a.y);
}
else if (b.p==1)
{
if (a.x-b.x == b.y-a.y)
return (b.y-a.y);
}
return -1;
}
else if (a.p==4)
{
if (b.p==3)
{
if (b.x==a.x and b.y<=a.y)
return (a.y-b.y)/2;
}
else if (b.p==2)
{
if (b.x-a.x == a.y-b.y)
return (a.y-b.y);
}
else if (b.p==1)
{
if (a.x-b.x == a.y-b.y)
return (a.y-b.y);
}
return -1;
}
return -1;
}
void solve()
{
int n, k, e, m, ans = 0;
cin >> n;
vector<ship> a(n);
int x,y,z;
char p;
rep(n)
{
cin >> a[i].x >> a[i].y >> p;
if (p=='E')
z=1;
if (p=='W')
z=2;
if (p=='N')
z=4;
if (p=='S')
z=3;
a[i].p=z;
// cout << a[i].x << " " << a[i].y <<" "<<p;ln;
}
vector<vi> shipsToSink;
rep(i,n)
{
rep(j,0,n)
{
int time = canSink(a[i],a[j]);
if (time ==-1)
continue;
shipsToSink.append({time,i+1,j+1});
assert(time>0);
// cout << a[i].idx<<" "<<a[j].idx <<" " << time<<endl;
}
}
sort(all(shipsToSink));
set<int> deadShips;
int nnn = shipsToSink.size();
for (int i=0;i<nnn;i++)
{
int j=i;
set<int> atDeath;
// cout <<"time "<< shipsToSink[i][0]<<endl;
while (j<nnn and shipsToSink[i][0]==shipsToSink[j][0])
{
if (!(deadShips.count(shipsToSink[j][1]) or deadShips.count(shipsToSink[j][2])))
{
atDeath.insert(shipsToSink[j][1]);
atDeath.insert(shipsToSink[j][2]);
}
j++;
}
for (auto i: atDeath)
{
// cout <<i<<" ";
deadShips.insert(i);
}
// ln;
i=j-1;
}
rep(n)
{
if (deadShips.count(i+1)==0)
{
cout << i+1 << "\n";
}
}
// cout << canSink(a[3],a[0]);ln;
// cout << a[3].p << " " << a[0].p ;ln;
// cout << ans;
// cout << a.size();
// for (auto i: a){cout << i << " ";}
}
signed main(){
Code by Hayan
int ans=1;
//cout<<setprecision(1000);
// cin>>ans;
rep(ans){
// cout << "Case #" << i+1 << ": ";
solve();}}
