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 str;
  map<pair<double, double>, bool> mp;
  double x = 0, y = 0;
  int ans = 0;
  cin >> str;
  for (int i = 0; i < str.length(); i++) {
    pair<double, double> pd;
    if (str[i] == 'N')
      pd = pair<double, double>(x, y + 0.5), y += 1.0;
    else if (str[i] == 'S')
      pd = pair<double, double>(x, y - 0.5), y -= 1.0;
    else if (str[i] == 'W')
      pd = pair<double, double>(x - 0.5, y), x -= 1.0;
    else
      pd = pair<double, double>(x + 0.5, y), x += 1.0;
    if (mp[pd])
      ans++;
    else {
      ans += 5;
      mp[pd] = true;
    }
  }
  cout << ans << '\n';
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T;
  cin >> T;
  while (T--) solve();
  return 0;
}
