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;
map<pair<pair<int, int>, pair<int, int>>, bool> vis;
pair<int, int> xy;
pair<int, int> x1y1;
int main() {
  map<char, int> d;
  d['N'] = 1;
  d['S'] = -1;
  d['E'] = 1;
  d['W'] = -1;
  int t;
  cin >> t;
  while (t--) {
    xy.first = 0;
    xy.second = 0;
    x1y1.first = 0;
    x1y1.second = 0;
    int counter = 0;
    string s;
    cin >> s;
    for (int i = 0; i < s.length(); i++) {
      if (s[i] == 'N' || s[i] == 'S') {
        x1y1.second += d[s[i]];
      } else {
        x1y1.first += d[s[i]];
      }
      if (vis[make_pair(xy, x1y1)] || vis[make_pair(x1y1, xy)]) {
        counter++;
      } else {
        counter += 5;
        vis[make_pair(xy, x1y1)] = true;
        vis[make_pair(x1y1, xy)] = true;
      }
      xy = x1y1;
    }
    cout << counter << "\n";
    vis.clear();
  }
  return 0;
}
