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 long long N = 2e5 + 5;
const long long mod = 998244353;
using namespace std;
struct node {
  long long x, y;
};
map<pair<long long, long long>, bool> mp;
string str;
signed main() {
  ios::sync_with_stdio(false), cin.tie(0);
  ;
  long long t;
  cin >> t;
  while (t--) {
    mp.clear();
    node sta;
    sta.x = 0;
    sta.y = 0;
    cin >> str;
    long long len = str.size();
    long long ans = 0;
    for (long long i = (0); i <= (len - 1); i++) {
      if (str[i] == 'N') {
        long long xx = sta.x * 1000000 + sta.y;
        sta.x++;
        long long yy = sta.x * 1000000 + sta.y;
        if (mp[make_pair(xx, yy)] == false && mp[make_pair(yy, xx)] == false) {
          ans += 5;
          mp[make_pair(xx, yy)] = true;
          mp[make_pair(yy, xx)] = true;
        } else {
          ans++;
        }
      } else if (str[i] == 'S') {
        long long xx = sta.x * 1000000 + sta.y;
        sta.x--;
        long long yy = sta.x * 1000000 + sta.y;
        if (mp[make_pair(xx, yy)] == false && mp[make_pair(yy, xx)] == false) {
          ans += 5;
          mp[make_pair(xx, yy)] = true;
          mp[make_pair(yy, xx)] = true;
        } else {
          ans++;
        }
      } else if (str[i] == 'W') {
        long long xx = sta.x * 1000000 + sta.y;
        sta.y++;
        long long yy = sta.x * 1000000 + sta.y;
        if (mp[make_pair(xx, yy)] == false && mp[make_pair(yy, xx)] == false) {
          ans += 5;
          mp[make_pair(xx, yy)] = true;
          mp[make_pair(yy, xx)] = true;
        } else {
          ans++;
        }
      } else if (str[i] == 'E') {
        long long xx = sta.x * 1000000 + sta.y;
        sta.y--;
        long long yy = sta.x * 1000000 + sta.y;
        if (mp[make_pair(xx, yy)] == false && mp[make_pair(yy, xx)] == false) {
          ans += 5;
          mp[make_pair(xx, yy)] = true;
          mp[make_pair(yy, xx)] = true;
        } else {
          ans++;
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
