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;
long double pi = 3.141592653589793238;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  cin >> t;
  while (t--) {
    string x;
    cin >> x;
    long long n = x.length();
    if (n == 0) {
      cout << 0 << endl;
    }
    if (n == 1) {
      cout << 5 << endl;
      continue;
    }
    set<tuple<long long, long long, long long, long long>> r1;
    long long curx = 0;
    long long cury = 0;
    long long cnt = 5;
    if (x[0] == 'N') {
      cury++;
      r1.insert(make_tuple(curx, cury - 1, curx, cury));
      r1.insert(make_tuple(curx, cury, curx, cury - 1));
    }
    if (x[0] == 'S') {
      cury--;
      r1.insert(make_tuple(curx, cury + 1, curx, cury));
      r1.insert(make_tuple(curx, cury, curx, cury + 1));
    }
    if (x[0] == 'E') {
      curx++;
      r1.insert(make_tuple(curx - 1, cury, curx, cury));
      r1.insert(make_tuple(curx, cury, curx - 1, cury));
    }
    if (x[0] == 'W') {
      curx--;
      r1.insert(make_tuple(curx + 1, cury, curx, cury));
      r1.insert(make_tuple(curx, cury, curx + 1, cury));
    }
    for (long long i = 1; i < n; i++) {
      if (x[i] == 'N') {
        cury++;
        if (r1.find(make_tuple(curx, cury - 1, curx, cury)) == r1.end()) {
          r1.insert(make_tuple(curx, cury - 1, curx, cury));
          cnt += 5;
          r1.insert(make_tuple(curx, cury, curx, cury - 1));
        } else
          cnt++;
      }
      if (x[i] == 'S') {
        cury--;
        if (r1.find(make_tuple(curx, cury + 1, curx, cury)) == r1.end()) {
          r1.insert(make_tuple(curx, cury + 1, curx, cury));
          cnt += 5;
          r1.insert(make_tuple(curx, cury, curx, cury + 1));
        } else
          cnt++;
      }
      if (x[i] == 'E') {
        curx++;
        if (r1.find(make_tuple(curx - 1, cury, curx, cury)) == r1.end()) {
          r1.insert(make_tuple(curx - 1, cury, curx, cury));
          cnt += 5;
          r1.insert(make_tuple(curx, cury, curx - 1, cury));
        } else
          cnt++;
      }
      if (x[i] == 'W') {
        curx--;
        if (r1.find(make_tuple(curx + 1, cury, curx, cury)) == r1.end()) {
          r1.insert(make_tuple(curx + 1, cury, curx, cury));
          cnt += 5;
          r1.insert(make_tuple(curx, cury, curx + 1, cury));
        } else
          cnt++;
      }
    }
    cout << cnt << endl;
  }
}
