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 n;
  cin >> n;
  while (n--) {
    string t;
    cin >> t;
    int ans = 0;
    set<pair<pair<int, int>, pair<int, int>>> vis;
    int x = 0;
    int y = 0;
    for (int i = 0; i < t.length(); i++) {
      int x1 = x;
      int y1 = y;
      if (t[i] == 'N') {
        y1++;
      } else if (t[i] == 'S') {
        y1--;
      } else if (t[i] == 'E') {
        x1--;
      } else {
        x1++;
      }
      if (vis.count({{x, y}, {x1, y1}}) == 0)
        ans += 5;
      else
        ans += 1;
      vis.insert({{x, y}, {x1, y1}});
      vis.insert({{x1, y1}, {x, y}});
      x = x1;
      y = y1;
    }
    cout << ans << endl;
  }
}
