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 func() {
  string s;
  cin >> s;
  long long n = s.length();
  set<pair<pair<long long, long long>, pair<long long, long long> > > s1;
  long long ans = 0, x = 0, y = 0;
  for (long long i = 0; i < n; ++i) {
    if (s[i] == 'N') {
      if (s1.count(make_pair(make_pair(x, y), make_pair(x, y + 1))) == 1) {
        ans += 1;
      } else {
        ans += 5;
        s1.insert(make_pair(make_pair(x, y), make_pair(x, y + 1)));
        s1.insert(make_pair(make_pair(x, y + 1), make_pair(x, y)));
      }
      ++y;
    }
    if (s[i] == 'S') {
      if (s1.count(make_pair(make_pair(x, y), make_pair(x, y - 1))) == 1) {
        ans += 1;
      } else {
        ans += 5;
        s1.insert(make_pair(make_pair(x, y), make_pair(x, y - 1)));
        s1.insert(make_pair(make_pair(x, y - 1), make_pair(x, y)));
      }
      --y;
    }
    if (s[i] == 'E') {
      if (s1.count(make_pair(make_pair(x, y), make_pair(x + 1, y))) == 1) {
        ans += 1;
      } else {
        ans += 5;
        s1.insert(make_pair(make_pair(x, y), make_pair(x + 1, y)));
        s1.insert(make_pair(make_pair(x + 1, y), make_pair(x, y)));
      }
      ++x;
    }
    if (s[i] == 'W') {
      if (s1.count(make_pair(make_pair(x, y), make_pair(x - 1, y))) == 1) {
        ans += 1;
      } else {
        ans += 5;
        s1.insert(make_pair(make_pair(x, y), make_pair(x - 1, y)));
        s1.insert(make_pair(make_pair(x - 1, y), make_pair(x, y)));
      }
      --x;
    }
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    func();
  }
}
