#include <bits/stdc++.h>
long long int mod = 1000000000 + 7;
long long int inf = (long long int)(1e18);
using namespace std;
mt19937 unlucko(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  iostream::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    map<pair<pair<int, int>, pair<int, int> >, bool> mp;
    int x = 0, y = 0;
    string s;
    cin >> s;
    int n = s.length();
    int ans = 0;
    for (int i = 0; i < n; i++) {
      int xx = x, yy = y;
      if (s[i] == 'N') y++;
      if (s[i] == 'S') y--;
      if (s[i] == 'E') x++;
      if (s[i] == 'W') x--;
      if (x < xx) {
        if (!mp[{{x, y}, {xx, yy}}])
          mp[{{x, y}, {xx, yy}}] = true, ans += 5;
        else
          ans++;
      } else if (xx < x) {
        swap(x, xx);
        if (!mp[{{x, y}, {xx, yy}}])
          mp[{{x, y}, {xx, yy}}] = true, ans += 5;
        else
          ans++;
        swap(x, xx);
      }
      if (y < yy) {
        if (!mp[{{x, y}, {xx, yy}}])
          mp[{{x, y}, {xx, yy}}] = true, ans += 5;
        else
          ans++;
      } else if (yy < y) {
        swap(y, yy);
        if (!mp[{{x, y}, {xx, yy}}])
          mp[{{x, y}, {xx, yy}}] = true, ans += 5;
        else
          ans++;
        swap(y, yy);
      }
    }
    cout << ans << "\n";
  }
}
