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>
long long int mod = 1000000000 + 7;
long long int inf = (long long int)(1e18);
using namespace std;
mt19937 unlucko(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  iostream::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    map<pair<pair<int, int>, pair<int, int> >, bool> mp;
    int x = 0, y = 0;
    string s;
    cin >> s;
    int n = s.length();
    int ans = 0;
    for (int i = 0; i < n; i++) {
      int xx = x, yy = y;
      if (s[i] == 'N') y++;
      if (s[i] == 'S') y--;
      if (s[i] == 'E') x++;
      if (s[i] == 'W') x--;
      if (x < xx) {
        if (!mp[{{x, y}, {xx, yy}}])
          mp[{{x, y}, {xx, yy}}] = true, ans += 5;
        else
          ans++;
      } else if (xx < x) {
        swap(x, xx);
        if (!mp[{{x, y}, {xx, yy}}])
          mp[{{x, y}, {xx, yy}}] = true, ans += 5;
        else
          ans++;
        swap(x, xx);
      }
      if (y < yy) {
        if (!mp[{{x, y}, {xx, yy}}])
          mp[{{x, y}, {xx, yy}}] = true, ans += 5;
        else
          ans++;
      } else if (yy < y) {
        swap(y, yy);
        if (!mp[{{x, y}, {xx, yy}}])
          mp[{{x, y}, {xx, yy}}] = true, ans += 5;
        else
          ans++;
        swap(y, yy);
      }
    }
    cout << ans << "\n";
  }
}
