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;
signed main() {
  std::ios::sync_with_stdio(false);
  long long int T;
  cin >> T;
  while (T--) {
    string second;
    cin >> second;
    long long int n = second.size();
    long long int x = 50000;
    long long int y = 50000;
    map<pair<long long int, long long int>, long long int> m;
    long long int on = 0;
    long long int ans = 0;
    map<pair<long long int, long long int>, long long int> m2;
    for (long long int i = 0; i < n; i++) {
      if (second[i] == 'N') {
        if (m[make_pair(x, y + 1)] == 1) {
          ans += 1;
        } else {
          ans += 5;
          on = 0;
          m[make_pair(x, y + 1)] = 1;
        }
        y += 1;
      } else if (second[i] == 'S') {
        if (m[make_pair(x, y)] == 1) {
          ans += 1;
        } else {
          ans += 5;
          on = 0;
          m[make_pair(x, y)] = 1;
        }
        y -= 1;
      } else if (second[i] == 'W') {
        if (m2[make_pair(x, y)] == 1) {
          ans += 1;
          on = 1;
        } else {
          ans += 5;
          on = 0;
          m2[make_pair(x, y)] = 1;
        }
        x -= 1;
      } else {
        if (m2[make_pair(x + 1, y)] == 1) {
          ans += 1;
          on = 1;
        } else {
          ans += 5;
          on = 0;
          m2[make_pair(x + 1, y)] = 1;
        }
        x += 1;
      }
    }
    cout << ans << "\n";
  }
  return 0;
}
