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>
const int INFI = (1 << 29);
const long long INFL = (1LL << 62);
using namespace std;
void solve() {
  long long x = 0, y = 0, r = 0;
  string s;
  cin >> s;
  map<pair<pair<long long, long long>, pair<long long, long long> >, bool> mapa;
  for (char i : s) {
    long long px = x, py = y;
    if (i == 'S')
      x++;
    else if (i == 'N')
      x--;
    else if (i == 'E')
      y++;
    else
      y--;
    if (mapa[{{px, py}, {x, y}}] || mapa[{{x, y}, {px, py}}])
      r++;
    else
      r += 5;
    mapa[{{px, py}, {x, y}}] |= 1;
  }
  cout << r << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long casos;
  cin >> casos;
  while (casos--) solve();
  return 0;
}
