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;
void solve() {
  string s;
  cin >> s;
  map<pair<pair<int, int>, pair<int, int>>, int> mp;
  int c = 0, i = 0, j = 0, m = 0, n = 0;
  for (int k = 0; k < s.size(); k++) {
    if (s[k] == 'E') {
      m = i;
      n = j;
      i++;
    } else if (s[k] == 'W') {
      m = i;
      n = j;
      i--;
    } else if (s[k] == 'N') {
      m = i;
      n = j;
      j++;
    } else if (s[k] == 'S') {
      m = i;
      n = j;
      j--;
    }
    pair<pair<int, int>, pair<int, int>> p1;
    pair<pair<int, int>, pair<int, int>> p2;
    p1 = make_pair(make_pair(i, j), make_pair(m, n));
    p2 = make_pair(make_pair(m, n), make_pair(i, j));
    if (mp.find(p1) != mp.end() || mp.find(p2) != mp.end()) {
      c++;
    } else {
      c = c + 5;
      mp[p1]++;
      mp[p2]++;
    }
  }
  cout << c << "\n";
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
