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 arr[105];
vector<int> graph[105];
struct node {
  int vx, vy;
};
bool operator<(node a, node b) {
  return make_pair(a.vx, a.vy) < make_pair(b.vx, b.vy);
}
int main() {
  int x, y;
  long long T, n, k;
  int cnt = 0;
  vector<int> v;
  map<node, map<node, int>> visit;
  string s;
  int n0, n1, n2, cs = 0;
  cin >> T;
  while (T--) {
    ++cs;
    cin >> s;
    visit.clear();
    x = 0, y = 0, cnt = 0;
    for (int i = 0; i < s.size(); i++) {
      int tx = x, ty = y;
      if (s[i] == 'E') {
        x++;
      }
      if (s[i] == 'W') {
        x--;
      }
      if (s[i] == 'S') {
        y++;
      }
      if (s[i] == 'N') {
        y--;
      }
      if (visit[{tx, ty}][{x, y}] == 1) {
        cnt++;
      } else {
        cnt += 5;
        visit[{tx, ty}][{x, y}] = 1;
        visit[{x, y}][{tx, ty}] = 1;
      }
    }
    cout << cnt << endl;
  }
  return 0;
}
