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;
int main() {
  int t;
  cin >> t;
  string s;
  while (t > 0) {
    cin >> s;
    int x, y;
    pair<int, int> pp;
    pair<int, int> pn;
    pair<pair<int, int>, pair<int, int> > pi;
    pn.first = 0;
    pn.second = 0;
    set<pair<pair<int, int>, pair<int, int> > > st;
    int rr = 0;
    for (int i = 0; i < s.length(); i++) {
      pp = pn;
      if (s[i] == 'N')
        pn.second++;
      else if (s[i] == 'S')
        pn.second--;
      else if (s[i] == 'E')
        pn.first++;
      else
        pn.first--;
      pi.first = pp;
      pi.second = pn;
      if (st.find(pi) == st.end())
        rr += 5;
      else
        rr += 1;
      st.insert(pi);
      pi.first = pn;
      pi.second = pp;
      st.insert(pi);
    }
    cout << rr << endl;
    t--;
  }
  return 0;
}
