/*
TASK:flower
LANG:C++
*/
#include <stdio.h>
#include <vector>
#include <algorithm>
#define FOR(i,n) for(int i=0;i<n;i++)
using namespace std;

vector<int> v;
int n;

bool check() {
     int a[4];
     a[0] = 0; a[1] = 0; a[2] = 0; a[3] = 0;
     FOR(i,n) {
        a[ v[i] ]++;
        if(a[0]<a[1]) return false;
        if(a[2]<a[3]) return false;
     }
     return true;
}

int main() {
    scanf("%d",&n);
    int i = 0;
    while(i<n) {
               char c = ' ';
               int tmp;
               while(c != 'N' && c!='W' && c!='E' && c!='S') scanf("%c",&c);
               if(c=='N') tmp = 0;
               else if(c=='S') tmp = 1;
               else if(c=='W') tmp = 2;
               else tmp = 3;
               v.push_back(tmp);
               i++;
    }
    sort(v.begin(),v.end());
    int res(0);
    check();
    do {
        if(check()) res++;
    } while(next_permutation(v.begin(),v.end()));
    printf("%d\n",res-1);
    return 0;
}
