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;
using P = pair<int, int>;
using S = pair<P, P>;
int close_sycn = (ios::sync_with_stdio(false), cin.tie(0), 0);
int main() {
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    P p(0, 0);
    int res = 0;
    set<S> st;
    for (int i = 0; i < s.length(); i++) {
      P t(p);
      if (s[i] == 'S') {
        t.first += 1;
      } else if (s[i] == 'N') {
        t.first -= 1;
      } else if (s[i] == 'W') {
        t.second -= 1;
      } else
        t.second += 1;
      if (st.count(S{min(p, t), max(p, t)}))
        res += 1;
      else {
        st.insert(S{min(p, t), max(p, t)});
        res += 5;
      }
      p = t;
    }
    cout << res << endl;
  }
  return 0;
}
