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 long int power(long long int x, long long int n, long long int m) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1) res = (res * x) % m;
    x = (x * x) % m;
    n = n >> 1;
  }
  return res;
}
long long int maxSubsetSum(vector<long long int> v) {
  long long int max_so_far = LLONG_MIN, max_ending_here = 0;
  for (long long int i = 0; i < (long long int)v.size(); i++) {
    max_ending_here += v[i];
    if (max_so_far < max_ending_here) max_so_far = max_ending_here;
    if (max_ending_here < 0) max_ending_here = 0;
  }
  return max_so_far;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    long long int res = 0;
    map<vector<long long int>, long long int> m;
    pair<long long int, long long int> p;
    p.first = p.second = 0;
    for (long long int i = 0; i < (long long int)s.length(); i++) {
      if (s[i] == 'N') {
        vector<long long int> curr = {p.first, p.second, p.first, p.second + 1};
        vector<long long int> curr1 = {p.first, p.second + 1, p.first,
                                       p.second};
        p.second += 1;
        if (m[curr] == 0)
          res += 5;
        else
          res += 1;
        m[curr] = 1;
        m[curr1] = 1;
      } else if (s[i] == 'S') {
        vector<long long int> curr = {p.first, p.second, p.first, p.second - 1};
        vector<long long int> curr1 = {p.first, p.second - 1, p.first,
                                       p.second};
        p.second -= 1;
        if (m[curr] == 0)
          res += 5;
        else
          res += 1;
        m[curr] = 1;
        m[curr1] = 1;
      } else if (s[i] == 'E') {
        vector<long long int> curr = {p.first + 1, p.second, p.first, p.second};
        vector<long long int> curr1 = {p.first, p.second, p.first + 1,
                                       p.second};
        p.first += 1;
        if (m[curr] == 0)
          res += 5;
        else
          res += 1;
        m[curr] = 1;
        m[curr1] = 1;
      } else {
        vector<long long int> curr = {p.first, p.second, p.first - 1, p.second};
        vector<long long int> curr1 = {p.first - 1, p.second, p.first,
                                       p.second};
        p.first -= 1;
        if (m[curr] == 0)
          res += 5;
        else
          res += 1;
        m[curr] = 1;
        m[curr1] = 1;
      }
    }
    cout << res << endl;
  }
  return 0;
}
