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>
using namespace std;
int main() {
  int t;
  cin >> t;
  string line;
  line.reserve(10000);
  set<pair<pair<int, int>, pair<int, int>>> routes;
  int fromX, fromY;
  int toX, toY;
  while (t-- > 0) {
    cin >> line;
    int score = 0;
    routes.clear();
    fromX = 0;
    fromY = 0;
    for (size_t i = 0; i < line.length(); ++i) {
      char ch = line.at(i);
      toX = fromX;
      toY = fromY;
      if (ch == 'N') {
        --toY;
      } else if (ch == 'S') {
        ++toY;
      } else if (ch == 'W') {
        --toX;
      } else {
        ++toX;
      }
      pair<int, int> pairFrom = make_pair(fromX, fromY);
      pair<int, int> pairTo = make_pair(toX, toY);
      pair<pair<int, int>, pair<int, int>> keyToFrom =
          make_pair(pairTo, pairFrom);
      auto iter = routes.find(keyToFrom);
      if (iter == routes.end()) {
        pair<pair<int, int>, pair<int, int>> keyFromTo =
            make_pair(pairFrom, pairTo);
        iter = routes.find(keyFromTo);
        if (iter == routes.end()) {
          score += 5;
          routes.insert(keyFromTo);
        } else {
          score += 1;
        }
      } else {
        score += 1;
      }
      fromX = toX;
      fromY = toY;
    }
    cout << score << endl;
  }
  return 0;
}
