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 = 1e5 + 5;
long long n, m, i, j;
set<pair<pair<long long, long long>, pair<long long, long long>>> st;
string s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  while (n--) {
    long long x = 0, y = 0, xprev = 0, yprev = 0, ans = 0;
    st.clear();
    cin >> s;
    for (char c : s) {
      if (c == 'N') y++;
      if (c == 'S') y--;
      if (c == 'E') x++;
      if (c == 'W') x--;
      auto p = make_pair(make_pair(xprev, yprev), make_pair(x, y));
      auto q = make_pair(make_pair(x, y), make_pair(xprev, yprev));
      if (st.count(p) || st.count(q))
        ans++;
      else {
        st.insert(p);
        st.insert(q);
        ans += 5;
      }
      xprev = x;
      yprev = y;
    }
    cout << ans << endl;
  }
}
