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 traveltime(std::string path) {
  using namespace std;
  int time = 0;
  set<pair<pair<int, int>, pair<int, int>>> travelled;
  pair<pair<int, int>, pair<int, int>> previous(make_pair(0, 0),
                                                make_pair(0, 0));
  for (auto cdir : path) {
    pair<pair<int, int>, pair<int, int>> direction;
    pair<int, int> destination;
    switch (cdir) {
      case 'N':
        destination =
            make_pair(previous.second.first, previous.second.second + 1);
        break;
      case 'S':
        destination =
            make_pair(previous.second.first, previous.second.second - 1);
        break;
      case 'E':
        destination =
            make_pair(previous.second.first + 1, previous.second.second);
        break;
      case 'W':
        destination =
            make_pair(previous.second.first - 1, previous.second.second);
        break;
    }
    direction = make_pair(previous.second, destination);
    auto reverse = make_pair(destination, previous.second);
    if (destination == previous.first ||
        travelled.find(direction) != travelled.end() ||
        travelled.find(reverse) != travelled.end()) {
      time += 1;
    } else {
      time += 5;
      travelled.insert(direction);
    }
    previous = direction;
  }
  return time;
}
int main() {
  int t;
  std::cin >> t;
  std::string path;
  getline(std::cin, path);
  for (int i = 0; i < t; i++) {
    getline(std::cin, path);
    std::cout << traveltime(path) << std::endl;
  }
  return 0;
}
