#include <bits/stdc++.h>
using namespace std;
const int INF = INT_MAX;
const long long limit = 1LL * 1e18;
const int MOD = 1e9 + 711;
const int MOD2 = 1e9 + 933;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
signed main() {
  cout.tie(0);
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int tt;
  cin >> tt;
  while (tt--) {
    string s;
    cin >> s;
    map<char, pair<int, int>> d;
    d['S'] = make_pair(-1, 0), d['N'] = make_pair(1, 0),
    d['W'] = make_pair(0, -1), d['E'] = make_pair(0, 1);
    map<pair<int, int>, set<pair<int, int>>> w;
    int ans = 0, x = 0, y = 0;
    for (int i = 0; i < s.size(); ++i) {
      int x1 = x + d[s[i]].second, y1 = y + d[s[i]].first;
      if (w[make_pair(x, y)].find(make_pair(x1, y1)) !=
              w[make_pair(x, y)].end() ||
          w[make_pair(x1, y1)].find(make_pair(x, y)) !=
              w[make_pair(x1, y1)].end()) {
        ans++;
      } else {
        ans += 5;
      }
      w[make_pair(x, y)].emplace(make_pair(x1, y1));
      x = x1, y = y1;
    }
    cout << ans << '\n';
  }
  return 0;
}
