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(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    long long n = s.length();
    map<pair<pair<long long, long long>, pair<long long, long long> >, bool> ma;
    pair<long long, long long> pa, push_back;
    pa = {0, 0};
    long long ans = 0;
    for (long long i = 0; i <= n - 1; i++) {
      if (s[i] == 'N') push_back = {pa.first, pa.second + 1};
      if (s[i] == 'E') push_back = {pa.first + 1, pa.second};
      if (s[i] == 'S') push_back = {pa.first, pa.second - 1};
      if (s[i] == 'W') push_back = {pa.first - 1, pa.second};
      if (ma[{pa, push_back}])
        ans += 1;
      else {
        ans += 5;
        ma[{pa, push_back}] = 1;
        ma[{push_back, pa}] = 1;
      }
      pa = push_back;
    }
    cout << ans;
    cout << "\n";
  }
  return 0;
}
