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;
  set<pair<pair<int, int>, pair<int, int> > > pt;
  int x = 0, y = 0, ans = 0;
  for (int i = 0; i < (int)s.size(); i++) {
    int x1 = x, y1 = y;
    if (s[i] == 'N')
      ++y1;
    else if (s[i] == 'E')
      ++x1;
    else if (s[i] == 'W')
      --x1;
    else
      --y1;
    if (pt.find({{x, y}, {x1, y1}}) == pt.end()) {
      pt.insert({{x, y}, {x1, y1}});
      pt.insert({{x1, y1}, {x, y}});
      ans += 5;
    } else
      ++ans;
    x = x1;
    y = y1;
  }
  cout << ans << endl;
  return;
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
