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_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t, n, i, ans, dx, dy, temp;
  string s;
  cin >> t;
  while (t--) {
    cin >> s;
    ans = 0;
    dx = 0;
    dy = 0;
    n = s.size();
    set<pair<pair<long long int, long long int>,
             pair<long long int, long long int>>>
        x;
    for (i = 0; i < n; i++) {
      if (s[i] == 'N') {
        temp = dy;
        dy++;
        if (x.count({{dx, temp}, {dx, dy}}))
          ans += 1;
        else if (x.count({{dx, dy}, {dx, temp}}))
          ans += 1;
        else {
          x.insert({{dx, temp}, {dx, dy}});
          ans += 5;
        }
      } else if (s[i] == 'S') {
        temp = dy;
        dy--;
        if (x.count({{dx, temp}, {dx, dy}}))
          ans += 1;
        else if (x.count({{dx, dy}, {dx, temp}}))
          ans += 1;
        else {
          x.insert({{dx, temp}, {dx, dy}});
          ans += 5;
        }
      } else if (s[i] == 'W') {
        temp = dx;
        dx--;
        if (x.count({{temp, dy}, {dx, dy}}))
          ans += 1;
        else if (x.count({{dx, dy}, {temp, dy}}))
          ans += 1;
        else {
          x.insert({{temp, dy}, {dx, dy}});
          ans += 5;
        }
      } else {
        temp = dx;
        dx++;
        if (x.count({{temp, dy}, {dx, dy}}))
          ans += 1;
        else if (x.count({{dx, dy}, {temp, dy}}))
          ans += 1;
        else {
          x.insert({{temp, dy}, {dx, dy}});
          ans += 5;
        }
      }
    }
    cout << ans << endl;
  }
}
