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>
int main() {
  int t;
  std::cin >> t;
  while (t--) {
    std::string str;
    std::cin >> str;
    std::map<std::pair<std::pair<int, int>, std::pair<int, int>>, int> path;
    std::pair<int, int> cur = std::make_pair(0, 0);
    std::pair<int, int> prev = std::make_pair(0, 0);
    int points = 0, len = str.length();
    for (int i = 0; i < len; i++) {
      if (str[i] == 'N') cur.second++;
      if (str[i] == 'S') cur.second--;
      if (str[i] == 'W') cur.first--;
      if (str[i] == 'E') cur.first++;
      std::pair<std::pair<int, int>, std::pair<int, int>> way =
          std::make_pair(prev, cur);
      std::pair<std::pair<int, int>, std::pair<int, int>> way2 =
          std::make_pair(cur, prev);
      if (path[way] || path[way2])
        points++;
      else
        points += 5;
      path[way]++;
      prev = cur;
    }
    std::cout << points << "\n";
  }
  return 0;
}
