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 t;
  cin >> t;
  while (t > 0) {
    string s;
    map<vector<int>, bool> v;
    cin >> s;
    int x = 0, y = 0, z = 0, n = s.size();
    for (int i = 0; i < n; i++) {
      int a = 0;
      if (s[i] == 'N')
        a = 1;
      else if (s[i] == 'S')
        a = -1;
      else if (s[i] == 'E')
        a = 2;
      else
        a = -2;
      vector<int> p(3, 0);
      p[0] = x;
      p[1] = y;
      p[2] = a;
      if (v[p] == 1) z++;
      if (abs(a) == 1)
        x += a;
      else
        y += abs(a) / a;
      if (v[p] == 0) {
        v[p] = 1;
        p[2] = -p[2];
        p[1] = y;
        p[0] = x;
        if (v[p] == 0) {
          v[p] = 1;
          z += 5;
        } else
          z++;
      }
    }
    cout << z << endl;
    t--;
  }
}
