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;
string toStr(pair<int, int> a, pair<int, int> b) {
  return to_string(a.first) + " " + to_string(a.second) + " " +
         to_string(b.first) + " " + to_string(b.second);
}
void solve() {
  string str;
  cin >> str;
  long long t = 0;
  unordered_set<string> s;
  pair<int, int> current = {0, 0}, prev;
  for (char c : str) {
    prev = current;
    switch (c) {
      case 'N':
        current.second++;
        break;
      case 'S':
        current.second--;
        break;
      case 'W':
        current.first--;
        break;
      case 'E':
        current.first++;
        break;
    }
    string path = toStr(prev, current);
    if (s.count(path) > 0) {
      t++;
    } else {
      t += 5;
      s.insert(path);
      s.insert(toStr(current, prev));
    }
  }
  cout << t << endl;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
