#include<bits/stdc++.h>

#define ls (id<<1)
#define rs ((id<<1)|1)

#define MAXN 200005
#define MAXSZ 600005

const int mv=2000000001;

struct Crash{
    int t;
    int xp,yp;

    friend bool operator<(Crash a,Crash b){
        return a.t>b.t;
    }
};
struct Node{
    int pl,pr;
    int px,py;
    int s;
};

int n;
int u[MAXN],v[MAXN]; char c[MAXN];
int rk[MAXSZ]; int ans[MAXN];
int typ[MAXSZ];
int p[MAXSZ],pos[MAXSZ],pl[MAXSZ],pr[MAXSZ];
Node t[MAXSZ<<2];
std::priority_queue<Crash> pq;
std::set<int> upd,us; int lst=0;

Node merge(Node a,Node b){
    Node res;
    if(a.pl+1) res.pl=a.pl;
    else res.pl=b.pl;
    if(b.pr+1) res.pr=b.pr;
    else res.pr=a.pr;
    int v=mv;
    if((a.pr+1)&&(b.pl+1)){
        v=p[b.pl]-p[a.pr];
        res.px=a.pr,res.py=b.pl;
    }
    if(a.s<b.s){
        if(a.s<v) v=a.s,res.px=a.px,res.py=a.py;
    }else if(b.s<v) v=b.s,res.px=b.px,res.py=b.py;
    res.s=v;
    return res;
}
void build(int id,int l,int r){
    if(l==r){
        if(typ[l]==1) t[id].px=t[id].py=t[id].pl=-1,t[id].pr=l,t[id].s=mv;
        else t[id].px=t[id].py=t[id].pr=-1,t[id].pl=l,t[id].s=mv;
        return;
    }
    int mid=(l+r)>>1;
    build(ls,l,mid),build(rs,mid+1,r);
    t[id]=merge(t[ls],t[rs]);
    return;
}
void del(int id,int l,int r,int pos){
    if(l==r) t[id].px=t[id].py=t[id].pl=t[id].pr=-1,t[id].s=mv;
    else{
        int mid=(l+r)>>1;
        if(pos<=mid) del(ls,l,mid,pos);
        else del(rs,mid+1,r,pos);
        t[id]=merge(t[ls],t[rs]);
    }
    return;
}
Node query(int id,int l,int r,int tl,int tr){
    if(tl<=l&&r<=tr) return t[id];
    int mid=(l+r)>>1;
    if(tr<=mid) return query(ls,l,mid,tl,tr);
    else if(tl>mid) return query(rs,mid+1,r,tl,tr);
    else return merge(query(ls,l,mid,tl,tr),query(rs,mid+1,r,tl,tr));
}

int read(){
    int res=0; char c=getchar();
    while(c<'0'||c>'9') c=getchar();
    while(c>='0'&&c<='9') res=(res<<3)+(res<<1)+(c^48),c=getchar();
    return res;
}
char readL(){
    char c=getchar();
    while(c<'A'||c>'Z') c=getchar();
    return c;
}

bool chk(int x,char a,char b){
    return c[x]==a||c[x]==b;
}

bool cmp1(int x,int y){
    if(chk(x,'N','W')^chk(y,'N','W')) return chk(x,'N','W');
    else if(u[x]+v[x]!=u[y]+v[y]) return u[x]+v[x]<u[y]+v[y];
    else return u[x]<u[y];
}
bool cmp2(int x,int y){
    if(chk(x,'N','E')^chk(y,'N','E')) return chk(x,'N','E');
    else if(u[x]-v[x]!=u[y]-v[y]) return u[x]-v[x]<u[y]-v[y];
    else return u[x]<u[y];
}
bool cmp3(int x,int y){
    if(chk(x,'N','S')^chk(y,'N','S')) return chk(x,'N','S');
    else{
        if(chk(x,'N','S')){
            if(u[x]!=u[y]) return u[x]<u[y];
            else return v[x]<v[y];
        }else{
            if(v[x]!=v[y]) return v[x]<v[y];
            else return u[x]<u[y];
        }
    }
}

int main(){
    n=read();
    for(int i=1;i<=n;i++) u[i]=read(),v[i]=read(),c[i]=readL();
    for(int i=1;i<=n;i++) rk[n+n+i]=rk[n+i]=rk[i]=i;
    std::sort(rk+1,rk+n+1,cmp1); 
    std::sort(rk+n+1,rk+n+n+1,cmp2);
    std::sort(rk+n+n+1,rk+n+n+n+1,cmp3);
    for(int i=1;i<=n;i++){
        if(chk(rk[i],'N','W')){
            if(i==1) pl[1]=1;
            else if(u[rk[i]]+v[rk[i]]==u[rk[i-1]]+v[rk[i-1]]) pl[i]=pl[i-1];
            else pl[i]=i;
            typ[i]=(c[rk[i]]=='N'?1:-1); pos[rk[i]]=i; p[i]=u[rk[i]]-v[rk[i]];
        }else{
            if(i==1) pl[1]=1;
            else if(chk(rk[i-1],'N','W')) pl[i]=i;
            else if(u[rk[i]]+v[rk[i]]==u[rk[i-1]]+v[rk[i-1]]) pl[i]=pl[i-1];
            else pl[i]=i;
            typ[i]=(c[rk[i]]=='E'?1:-1); pos[rk[i]]=i; p[i]=u[rk[i]]-v[rk[i]];
        }
    }
    for(int i=n+1;i<=2*n;i++){
        if(chk(rk[i],'N','E')){
            if(i==n+1) pl[n+1]=n+1;
            else if(u[rk[i]]-v[rk[i]]==u[rk[i-1]]-v[rk[i-1]]) pl[i]=pl[i-1];
            else pl[i]=i;
            typ[i]=(c[rk[i]]=='E'?1:-1); pos[rk[i]+n]=i,p[i]=u[rk[i]]+v[rk[i]];
        }else{
            if(i==n+1) pl[n+1]=n+1;
            else if(chk(rk[i],'N','E')) pl[i]=i;
            else if(u[rk[i]]-v[rk[i]]==u[rk[i-1]]-v[rk[i-1]]) pl[i]=pl[i-1];
            else pl[i]=i;
            typ[i]=(c[rk[i]]=='S'?1:-1); pos[rk[i]+n]=i,p[i]=u[rk[i]]+v[rk[i]];
        }
    }
    for(int i=2*n+1;i<=3*n;i++){
        if(chk(rk[i],'N','S')){
            if(i==2*n+1) pl[2*n+1]=2*n+1;
            else if(u[rk[i]]==u[rk[i-1]]) pl[i]=pl[i-1];
            else pl[i]=i;
            typ[i]=(c[rk[i]]=='D'?1:-1); pos[rk[i]+n*2]=i,p[i]=v[rk[i]];
        }else{
            if(i==2*n+1) pl[2*n+1]=2*n+1;
            else if(chk(rk[i],'N','S')) pl[i]=i;
            else if(v[rk[i]]==v[rk[i-1]]) pl[i]=pl[i-1];
            else pl[i]=i;
            typ[i]=(c[rk[i]]=='E'?1:-1); pos[rk[i]+n*2]=i,p[i]=u[rk[i]];
        }
    }
    pr[3*n]=3*n;
    for(int i=3*n-1;i>=1;i--){
        if(pl[i]==pl[i+1]) pr[i]=pr[i+1];
        else pr[i]=i;
    }

    build(1,1,3*n);
    
    for(int i=1;i<=3*n;i++){
        if(pl[i]==i){
            Node d=query(1,1,3*n,pl[i],pr[i]);
            if(d.s!=mv) pq.push((Crash){d.s,d.px,d.py});
        }
    }
    while(!pq.empty()){
        if(pq.top().t>lst){
            us.clear();
            for(int i:upd){
                del(1,1,3*n,pos[i]); del(1,1,3*n,pos[i+n]); del(1,1,3*n,pos[i+2*n]);
                us.insert(pl[i]); us.insert(pl[i+n]); us.insert(pl[i+2*n]);
            }
            for(int i:us){
                Node d=query(1,1,3*n,pl[i],pr[i]);
                if(d.s!=mv) pq.push((Crash){d.s,d.px,d.py});                
            }
            upd.clear();
        }
        bool xok=ans[rk[pq.top().xp]]&&(ans[rk[pq.top().xp]]<pq.top().t);
        bool yok=ans[rk[pq.top().yp]]&&(ans[rk[pq.top().yp]]<pq.top().t);
        if(xok||yok){
            pq.pop(); continue;
        }
        ans[rk[pq.top().xp]]=ans[rk[pq.top().yp]]=pq.top().t;
        del(1,1,3*n,pq.top().xp),del(1,1,3*n,pq.top().yp);
        upd.insert(rk[pq.top().xp]),upd.insert(rk[pq.top().yp]);
        Node d=query(1,1,3*n,pl[pq.top().xp],pr[pq.top().xp]);
        if(d.s!=mv) pq.push((Crash){d.s,d.px,d.py});          
        lst=pq.top().t;
        pq.pop();
    }
    for(int i=1;i<=n;i++){
        if(!ans[i]) std::cout<<i<<'\n';
    }

    return 0;
}