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;
const long long N = 2e5 + 3, big = 9e18, mod = 1e9 + 7;
const double pi = acos(-1);
long long n, t, m, k;
int ax[] = {0, 0, 1, -1};
int ay[] = {1, -1, 0, 0};
map<char, int> mp;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  mp['N'] = 0;
  mp['S'] = 1;
  mp['W'] = 3;
  mp['E'] = 2;
  cin >> t;
  while (t--) {
    long long x = 0, y = 0, ans = 0;
    string s;
    map<pair<pair<long long, long long>, pair<long long, long long> >, bool>
        vis;
    cin >> s;
    for (int i = 0; i < s.size(); i++) {
      int dir = mp[s[i]], corx = x + ax[dir], cory = y + ay[dir];
      pair<long long, long long> now = make_pair(x, y),
                                 Next = make_pair(corx, cory);
      if (vis[make_pair(now, Next)] || vis[make_pair(Next, now)])
        ans++;
      else
        ans += 5;
      vis[make_pair(now, Next)] = 1, x = corx, y = cory;
    }
    cout << ans << endl;
  }
}
