#include <bits/stdc++.h>
using namespace std;
int arr[105];
vector<int> graph[105];
struct node {
  int vx, vy;
};
bool operator<(node a, node b) {
  return make_pair(a.vx, a.vy) < make_pair(b.vx, b.vy);
}
int main() {
  int x, y;
  long long T, n, k;
  int cnt = 0;
  vector<int> v;
  map<node, map<node, int>> visit;
  string s;
  int n0, n1, n2, cs = 0;
  cin >> T;
  while (T--) {
    ++cs;
    cin >> s;
    visit.clear();
    x = 0, y = 0, cnt = 0;
    for (int i = 0; i < s.size(); i++) {
      int tx = x, ty = y;
      if (s[i] == 'E') {
        x++;
      }
      if (s[i] == 'W') {
        x--;
      }
      if (s[i] == 'S') {
        y++;
      }
      if (s[i] == 'N') {
        y--;
      }
      if (visit[{tx, ty}][{x, y}] == 1) {
        cnt++;
      } else {
        cnt += 5;
        visit[{tx, ty}][{x, y}] = 1;
        visit[{x, y}][{tx, ty}] = 1;
      }
    }
    cout << cnt << endl;
  }
  return 0;
}
