#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
  if (n < 2) return false;
  for (long long x = 2; x * x <= n; x++) {
    if (n % x == 0) return false;
  }
  return true;
}
bool isPerfectSquare(long double x) {
  long double sr = sqrt(x);
  return ((sr - floor(sr)) == 0);
}
int gcd(int a, int b) {
  if (a == 0) return b;
  if (b == 0) return a;
  if (a == b) return a;
  if (a > b) return gcd(a - b, b);
  return gcd(a, b - a);
}
int32_t main() {
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int n = (int)s.size();
    int ans = 0;
    map<pair<pair<int, int>, pair<int, int>>, int> m;
    int x = 0, y = 0;
    for (int i = 0; i < n; i++) {
      int nowx = x, nowy = y;
      if (s[i] == 'N') y++;
      if (s[i] == 'S') y--;
      if (s[i] == 'E') x--;
      if (s[i] == 'W') x++;
      if (m[{{x, y}, {nowx, nowy}}] || m[{{nowx, nowy}, {x, y}}]) {
        ans++;
      } else {
        ans += 5;
      }
      m[{{x, y}, {nowx, nowy}}]++;
    }
    cout << ans << "\n";
  }
}
