/*
TASK:flower
LANG:C++
*/

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>

using namespace std;

#define MAXN 52

int dp[MAXN][MAXN][MAXN][MAXN];
int N, S, W, E;
int all;

int main() {
    
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
    
    scanf("%d\n", &all);
    char c;
    for (int i = 0; i < all; i++) {
        scanf("%c%*c", &c);
        if (c == 'N') {
            N++;
        }
        else if (c == 'S') {
            S++;
        }
        else if (c == 'E') {
            E++;
        }
        else if (c == 'W') {
            W++;
        }
    }
    printf("%d %d %d %d\n", N, S, E, W);
    
    return 0;
}
