Skier rides on a snowy field. Its movements can be described by a string of characters 'S', 'N', 'W', 'E' (which correspond to 1 meter movement in the south, north, west or east direction respectively).

It is known that if he moves along a previously unvisited segment of a path (i.e. this segment of the path is visited the first time), then the time of such movement is 5 seconds. If he rolls along previously visited segment of a path (i.e., this segment of the path has been covered by his path before), then it takes 1 second.

Find the skier's time to roll all the path.

Input

The first line contains an integer t (1 ≤ t ≤ 10^4) — the number of test cases in the input. Then t test cases follow.

Each set is given by one nonempty string of the characters 'S', 'N', 'W', 'E'. The length of the string does not exceed 10^5 characters.

The sum of the lengths of t given lines over all test cases in the input does not exceed 10^5.

Output

For each test case, print the desired path time in seconds.

Example

Input


5
NNN
NS
WWEN
WWEE
NWNWS


Output


15
6
16
12
25
#include <bits/stdc++.h>
char *fs, *ft, buf[1 << 20];
inline long long read() {
  long long x = 0, f = 1;
  char ch =
      (fs == ft && (ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin), fs == ft))
          ? 0
          : *fs++;
  ;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = (fs == ft &&
          (ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin), fs == ft))
             ? 0
             : *fs++;
    ;
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = (fs == ft &&
          (ft = (fs = buf) + fread(buf, 1, 1 << 20, stdin), fs == ft))
             ? 0
             : *fs++;
    ;
  }
  return x * f;
}
using namespace std;
const long long N = 1e5 + 5;
const long long inf = 0x7fffffff;
const long long mod = 1e9 + 7;
const double eps = 1e-6;
signed main() {
  long long t;
  cin >> t;
  while (t--) {
    map<pair<long long, long long>, long long> ma[4];
    string s;
    cin >> s;
    long long x = 0, y = 0, res = 0;
    for (auto i : s) {
      if (i == 'N') {
        if (ma[0][make_pair(x, y)] == 1 || ma[1][make_pair(x - 1, y)] == 1)
          res++;
        else
          res += 5;
        ma[0][make_pair(x, y)] = 1;
        ma[1][make_pair(x - 1, y)] = 1;
        x -= 1;
      }
      if (i == 'S') {
        if (ma[1][make_pair(x, y)] == 1 || ma[0][make_pair(x + 1, y)] == 1)
          res++;
        else
          res += 5;
        ma[1][make_pair(x, y)] = 1;
        ma[0][make_pair(x + 1, y)] = 1;
        x += 1;
      }
      if (i == 'E') {
        if (ma[2][make_pair(x, y)] == 1 || ma[3][make_pair(x, y + 1)] == 1)
          res++;
        else
          res += 5;
        ma[2][make_pair(x, y)] = 1;
        ma[3][make_pair(x, y + 1)] = 1;
        y += 1;
      }
      if (i == 'W') {
        if (ma[3][make_pair(x, y)] == 1 || ma[2][make_pair(x, y - 1)] == 1)
          res++;
        else
          res += 5;
        ma[3][make_pair(x, y)] = 1;
        ma[2][make_pair(x, y - 1)] = 1;
        y -= 1;
      }
    }
    cout << res << '\n';
  }
}
