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;
  long long int ans = 0;
  long long int x, y;
  x = y = 0;
  set<pair<pair<long long int, long long int>,
           pair<long long int, long long int> > >
      second;
  for (long long int i = 0; i < s.size(); i++) {
    if (s[i] == 'S') {
      if (second.find({{x, y}, {x, y - 1}}) != second.end() ||
          second.find({{x, y - 1}, {x, y}}) != second.end()) {
        ans++;
      } else
        ans += 5;
      second.insert({{x, y}, {x, y - 1}});
      y--;
    } else if (s[i] == 'N') {
      if (second.find({{x, y}, {x, y + 1}}) != second.end() ||
          second.find({{x, y + 1}, {x, y}}) != second.end()) {
        ans++;
      } else
        ans += 5;
      second.insert({{x, y}, {x, y + 1}});
      y++;
    } else if (s[i] == 'E') {
      if (second.find({{x, y}, {x + 1, y}}) != second.end() ||
          second.find({{x + 1, y}, {x, y}}) != second.end()) {
        ans++;
      } else
        ans += 5;
      second.insert({{x, y}, {x + 1, y}});
      x++;
    } else {
      if (second.find({{x, y}, {x - 1, y}}) != second.end() ||
          second.find({{x - 1, y}, {x, y}}) != second.end()) {
        ans++;
      } else
        ans += 5;
      second.insert({{x, y}, {x - 1, y}});
      x--;
    }
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
