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;
int T, n, m, k;
string s;
set<pair<pair<int, int>, pair<int, int> > > ss;
inline int get(int a, int b, int c, int d) {
  if (a > c) swap(a, c);
  if (b > d) swap(b, d);
  auto t = make_pair(make_pair(a, b), make_pair(c, d));
  if (ss.find(t) != ss.end())
    return 1;
  else
    ss.insert(t);
  return 5;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> T;
  while (T--) {
    int ans = 0;
    ss.clear();
    cin >> s;
    int ox = 0, oy = 0, nx = 0, ny = 0;
    for (auto x : s) {
      if (x == 'N')
        nx = ox, ny = oy + 1;
      else if (x == 'S')
        nx = ox, ny = oy - 1;
      else if (x == 'W')
        nx = ox - 1, ny = oy;
      else
        nx = ox + 1, ny = oy;
      ans += get(ox, oy, nx, ny);
      ox = nx, oy = ny;
    }
    cout << ans << endl;
  }
  return 0;
}
