#include <bits/stdc++.h>
using namespace std;
long double pi = 3.141592653589793238;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  cin >> t;
  while (t--) {
    string x;
    cin >> x;
    long long n = x.length();
    if (n == 0) {
      cout << 0 << endl;
    }
    if (n == 1) {
      cout << 5 << endl;
      continue;
    }
    set<tuple<long long, long long, long long, long long>> r1;
    long long curx = 0;
    long long cury = 0;
    long long cnt = 5;
    if (x[0] == 'N') {
      cury++;
      r1.insert(make_tuple(curx, cury - 1, curx, cury));
      r1.insert(make_tuple(curx, cury, curx, cury - 1));
    }
    if (x[0] == 'S') {
      cury--;
      r1.insert(make_tuple(curx, cury + 1, curx, cury));
      r1.insert(make_tuple(curx, cury, curx, cury + 1));
    }
    if (x[0] == 'E') {
      curx++;
      r1.insert(make_tuple(curx - 1, cury, curx, cury));
      r1.insert(make_tuple(curx, cury, curx - 1, cury));
    }
    if (x[0] == 'W') {
      curx--;
      r1.insert(make_tuple(curx + 1, cury, curx, cury));
      r1.insert(make_tuple(curx, cury, curx + 1, cury));
    }
    for (long long i = 1; i < n; i++) {
      if (x[i] == 'N') {
        cury++;
        if (r1.find(make_tuple(curx, cury - 1, curx, cury)) == r1.end()) {
          r1.insert(make_tuple(curx, cury - 1, curx, cury));
          cnt += 5;
          r1.insert(make_tuple(curx, cury, curx, cury - 1));
        } else
          cnt++;
      }
      if (x[i] == 'S') {
        cury--;
        if (r1.find(make_tuple(curx, cury + 1, curx, cury)) == r1.end()) {
          r1.insert(make_tuple(curx, cury + 1, curx, cury));
          cnt += 5;
          r1.insert(make_tuple(curx, cury, curx, cury + 1));
        } else
          cnt++;
      }
      if (x[i] == 'E') {
        curx++;
        if (r1.find(make_tuple(curx - 1, cury, curx, cury)) == r1.end()) {
          r1.insert(make_tuple(curx - 1, cury, curx, cury));
          cnt += 5;
          r1.insert(make_tuple(curx, cury, curx - 1, cury));
        } else
          cnt++;
      }
      if (x[i] == 'W') {
        curx--;
        if (r1.find(make_tuple(curx + 1, cury, curx, cury)) == r1.end()) {
          r1.insert(make_tuple(curx + 1, cury, curx, cury));
          cnt += 5;
          r1.insert(make_tuple(curx, cury, curx + 1, cury));
        } else
          cnt++;
      }
    }
    cout << cnt << endl;
  }
}
