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(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    string s;
    cin >> s;
    map<pair<pair<int, int>, pair<int, int>>, int> coordinates;
    long long ans = 0;
    int curx = 0;
    int cury = 0;
    int a = 0;
    int b = 0;
    for (int x = 0; x < s.length(); x++) {
      if (s[x] == 'S') {
        cury--;
      } else if (s[x] == 'N') {
        cury++;
      } else if (s[x] == 'W') {
        curx--;
      } else {
        curx++;
      }
      if (coordinates[{{a, b}, {curx, cury}}] ||
          coordinates[{{curx, cury}, {a, b}}]) {
        ans++;
      } else {
        ans += 5;
        coordinates[{{a, b}, {curx, cury}}] = 1;
        coordinates[{{curx, cury}, {a, b}}] = 1;
      }
      a = curx;
      b = cury;
    }
    cout << ans << '\n';
  }
  return 0;
}
