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);
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int n = 0, e = 0;
    map<pair<pair<long long, long long>, pair<long long, long long>>, long long>
        mp;
    int mn = 0, ms = 0, mw = 0, me = 0;
    long long cost = 0;
    for (int i = 0; i < s.size(); i++) {
      if (s[i] == 'N') {
        n++;
        if (mp[{{n - 1, e}, {n, e}}] > 0)
          cost += 1;
        else {
          cost += 5;
          mp[{{n - 1, e}, {n, e}}] = 1;
          mp[{{n, e}, {n - 1, e}}] = 1;
        }
      } else if (s[i] == 'S') {
        n--;
        if (mp[{{n + 1, e}, {n, e}}] > 0)
          cost += 1;
        else {
          cost += 5;
          mp[{{n + 1, e}, {n, e}}] = 1;
          mp[{{n, e}, {n + 1, e}}] = 1;
        }
      } else if (s[i] == 'E') {
        e++;
        if (mp[{{n, e - 1}, {n, e}}] > 0)
          cost += 1;
        else {
          cost += 5;
          mp[{{n, e - 1}, {n, e}}] = 1;
          mp[{{n, e}, {n, e - 1}}] = 1;
        }
      } else {
        e--;
        if (mp[{{n, e + 1}, {n, e}}] > 0)
          cost += 1;
        else {
          cost += 5;
          mp[{{n, e + 1}, {n, e}}] = 1;
          mp[{{n, e}, {n, e + 1}}] = 1;
        }
      }
    }
    cout << cost << endl;
  }
  return 0;
}
