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;
const int maxn = 1e6 + 7;
const int mod = 1e9 + 7;
char s[100][100];
int num[100] = {0};
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
int main() {
  int n, m, t, ans = 0, a, b;
  cin >> t;
  string s;
  map<pair<pair<int, int>, pair<int, int>>, int> mp;
  while (t--) {
    mp.clear();
    cin >> s;
    long long ans = 0;
    int x = 0, y = 0, p, q;
    for (int i = 0; i < s.size(); i++) {
      if (s[i] == 'N')
        p = 0, q = 1;
      else if (s[i] == 'S')
        p = 1, q = 0;
      else if (s[i] == 'W')
        p = 2, q = 3;
      else
        p = 3, q = 2;
      mp[{{x, y}, {dx[q], dy[q]}}]++;
      x += dx[p], y += dy[p];
      if (mp[{{x, y}, {dx[p], dy[p]}}])
        ans += 1;
      else
        ans += 5;
      mp[{{x, y}, {dx[p], dy[p]}}]++;
    }
    cout << ans << endl;
  }
  return 0;
}
