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;
void solve() {
  string s;
  cin >> s;
  pair<int, int> p1 = {0, 0};
  set<pair<pair<int, int>, pair<int, int>>> p;
  int ans = 0;
  for (char c : s) {
    pair<int, int> p0 = p1;
    if (c == 'N') {
      p0.first--;
    } else if (c == 'S')
      p0.first++;
    else if (c == 'E')
      p0.second++;
    else if (c == 'W')
      p0.second--;
    else
      assert(false);
    if (p.count({p0, p1}) || p.count({p1, p0}))
      ans++;
    else
      ans += 5;
    p.insert({p0, p1});
    p1 = p0;
  }
  cout << ans << "\n";
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
