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 test = 1, c;
  cin >> test;
  for (c = 0; c < test; c++) {
    string s;
    cin >> s;
    int b, d;
    map<pair<pair<int, int>, pair<int, int>>, int> m;
    int x = 0, y = 0;
    long long int ans = 0;
    for (b = 0; b < s.length(); b++) {
      if (s[b] == 'N') {
        if (m[{{x, y}, {x, y + 1}}]) {
          ans++;
        } else {
          ans += 5;
          m[{{x, y}, {x, y + 1}}] = 1;
          m[{{x, y + 1}, {x, y}}] = 1;
        }
        y++;
      }
      if (s[b] == 'S') {
        if (m[{{x, y}, {x, y - 1}}]) {
          ans++;
        } else {
          ans += 5;
          m[{{x, y}, {x, y - 1}}] = 1;
          m[{{x, y - 1}, {x, y}}] = 1;
        }
        y--;
      }
      if (s[b] == 'E') {
        if (m[{{x, y}, {x + 1, y}}]) {
          ans++;
        } else {
          ans += 5;
          m[{{x, y}, {x + 1, y}}] = 1;
          m[{{x + 1, y}, {x, y}}] = 1;
        }
        x++;
      }
      if (s[b] == 'W') {
        if (m[{{x, y}, {x - 1, y}}]) {
          ans++;
        } else {
          ans += 5;
          m[{{x, y}, {x - 1, y}}] = 1;
          m[{{x - 1, y}, {x, y}}] = 1;
        }
        x--;
      }
    }
    cout << ans << endl;
  }
}
