#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define REP(i,a,b) for (auto i = a; i != b; i++)
#define maxheap priority_queue < ll, std::vector<ll>, std::less<ll> >
#define minheap priority_queue < ll, std::vector<ll>, std::greater<ll> >   // mxheap.push(), mxheap.top(), mxheap.pop()
#define ll long long int
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(),c.end()
#define mp(x,y) make_pair(x,y)
#define mem(a,val) memset(a,val,sizeof(a))
#define eb emplace_back
#define f first
#define s second
#define pb push_back
#define SQ(a) (a)*(a)
 
using namespace std;
// using namespace FastIO;
void read(int n,vector<int>& x)
{
    x.clear();
    x.resize(n);
    for(int i = 0;i<n;i++)
    {
        cin>>x[i];
    }
    
}
void read(int n,int m,vector<vector<int>>& x)
{
    x.clear();
    x.resize(n,vector<int>(m));
    for(int i = 0;i<n;i++)
    {
        for(int j = 0 ;j<m;j++)
            cin>>x[i][j];
    }
}
void read(int n,vector<vector<int>>& x)
{
    x.clear();
    x.resize(n+1);
    for(int i = 0;i<n-1;i++)
    {
         int a,b;
         cin>>a>>b;
         x[a].pb(b);
         x[b].pb(a);
    }
}
void read(int n,vector<vector<int>>& x,int m)
{
    x.clear();
    x.resize(n+1);
    for(int i = 0;i<m;i++)
    {
         int a,b;
         cin>>a>>b;
         x[a].pb(b);
         x[b].pb(a);
    }
}
void read(int n,vector<ll>& x)
{
    x.clear();
    x.resize(n);
    for(int i = 0;i<n;i++)
    {
        cin>>x[i];
    }
}
bool comp(pair<pair<int,int>,int> a,pair<pair<int,int>,int> b)
{
    return a.first.second < b.first.second;
}
bool comp1(pair<pair<int,int>,int> a,pair<pair<int,int>,int> b)
{
    return a.first.first < b.first.first;
}
int main()
{
    std::ios::sync_with_stdio(false);
    int T = 1;
    // freopen("mixmilk.in", "r", stdin);
    // freopen("mixmilk.out", "w", stdout);
    // cin>>T;
    for(int t = 1;t<=T;t++)
    {
        // cout<<"Case #"<<t<<": ";
        int n;
        cin>>n;
        vector<pair<pair<int,int>,int>> North;
        vector<pair<pair<int,int>,int>> East;
        vector<int> ans(n,-1);
        vector<int> parent(n,-1);
        vector<int> blame(n);
        for(int  i = 0;i<n;i++)
        {
            char a;
            cin>>a;
            if(a == 'N')
            {
                int x,y;
                cin>>x>>y;
                North.pb(make_pair(make_pair(x,y),i));
                
            }
            if(a == 'E')
            {
                int x,y;
                cin>>x>>y;
                East.pb(make_pair(make_pair(x,y),i));
            }
        }
        sort(all(East),comp);
        sort(all(North),comp1);
        for(int i = 0;i<North.size();i++)
        {
            for(int j = 0;j<East.size();j++)
            {
                pair<int,int> posscrashloc = mp(North[i].first.first,East[j].first.second);
                if(North[i].first.second > posscrashloc.second || East[j].first.first > posscrashloc.first)
                {
                    continue;
                }
                else if(ans[North[i].second] != -1 || ans[East[j].second] != -1 )
                {
                    continue;
                }
                else
                {
                    if(posscrashloc.second - North[i].first.second > posscrashloc.first -East[j].first.first)
                    {
                        ans[North[i].second] = posscrashloc.second - North[i].first.second;
                        parent[North[i].second] = East[j].second;
                        // cout<<North[i].second<<" "<<East[j].second<<" "<<1<<endl;
                    }
                    else if(posscrashloc.second - North[i].first.second < posscrashloc.first - East[j].first.first)
                    {
                        ans[East[j].second] = posscrashloc.first - East[j].first.first;
                        parent[East[j].second] = North[i].second;
                        // cout<<North[i].second<<" "<<East[j].second<<" "<<2<<endl;
                    }
                }
            }
        }  
        for(int i = 0;i<n;i++)
        {
            if(parent[i] != -1)
            {
                int temp = i;
                while(parent[temp] != -1)
                {
                    temp = parent[temp];
                    blame[temp]++;
                }
                // blame[temp]++;
            }
        }
        for(int i = 0;i<n;i++)
        {
            cout<<blame[i]<<endl;
        }
        
    }

    return 0;
}