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 int INF = INT_MAX;
const long long limit = 1LL * 1e18;
const int MOD = 1e9 + 711;
const int MOD2 = 1e9 + 933;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
signed main() {
  cout.tie(0);
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int tt;
  cin >> tt;
  while (tt--) {
    string s;
    cin >> s;
    map<char, pair<int, int>> d;
    d['S'] = make_pair(-1, 0), d['N'] = make_pair(1, 0),
    d['W'] = make_pair(0, -1), d['E'] = make_pair(0, 1);
    map<pair<int, int>, set<pair<int, int>>> w;
    int ans = 0, x = 0, y = 0;
    for (int i = 0; i < s.size(); ++i) {
      int x1 = x + d[s[i]].second, y1 = y + d[s[i]].first;
      if (w[make_pair(x, y)].find(make_pair(x1, y1)) !=
              w[make_pair(x, y)].end() ||
          w[make_pair(x1, y1)].find(make_pair(x, y)) !=
              w[make_pair(x1, y1)].end()) {
        ans++;
      } else {
        ans += 5;
      }
      w[make_pair(x, y)].emplace(make_pair(x1, y1));
      x = x1, y = y1;
    }
    cout << ans << '\n';
  }
  return 0;
}
