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;
template <class T, class U>
void maximize(T &lhs, U rhs) {
  if (lhs < rhs) lhs = rhs;
}
template <class T, class U>
void minimize(T &lhs, U rhs) {
  if (lhs > rhs) lhs = rhs;
}
template <class T>
T tabs(T x) {
  return (x < (T)0 ? -x : x);
}
namespace Task {
const int tx[] = {0, 0, -1, 1};
const int ty[] = {-1, 1, 0, 0};
const char dir[] = {'S', 'N', 'W', 'E'};
void solve() {
  int T;
  cin >> T;
  while (T--) {
    string s;
    cin >> s;
    int x = 0, y = 0;
    int cnt = 0;
    map<pair<int, int>, int> pos;
    map<pair<int, int>, int> vis;
    int ans = 0;
    pos[make_pair(x, y)] = ++cnt;
    for (int i = 0; i < (int)((s).size()); ++i) {
      int prev_x = x, prev_y = y;
      for (int j = 0; j < 4; ++j) {
        if (dir[j] == s[i]) {
          x += tx[j];
          y += ty[j];
        }
      }
      if (!pos[make_pair(x, y)]) {
        pos[make_pair(x, y)] = ++cnt;
        int u = pos[make_pair(prev_x, prev_y)];
        vis[make_pair(u, cnt)] = true;
        ans += 5;
      } else {
        int u = pos[make_pair(prev_x, prev_y)];
        int v = pos[make_pair(x, y)];
        if (u > v) {
          swap(u, v);
        }
        if (vis[make_pair(u, v)]) {
          ans += 1;
        } else {
          ans += 5;
        }
        vis[make_pair(u, v)] = true;
      }
    }
    cout << ans << '\n';
  }
}
}  // namespace Task
int main(int argc, char **argv) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  Task::solve();
}
