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() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    string st;
    int sol = 0;
    cin >> st;
    set<pair<pair<int, int>, pair<int, int>>> s;
    s.insert({{0, 0}, {0, 0}});
    pair<int, int> it = {0, 0};
    for (auto &x : st) {
      auto it2 = it;
      if (x == 'N') it.first--;
      if (x == 'S') it.first++;
      if (x == 'E') it.second++;
      if (x == 'W') it.second--;
      pair<pair<int, int>, pair<int, int>> lol = {min(it, it2), max(it, it2)};
      if (s.count(lol)) {
        sol++;
      } else {
        sol += 5;
        s.insert(lol);
      }
    }
    cout << sol << "\n";
  }
  return 0;
}
