from collections import defaultdict
def walk(x,y,d) :
if d == "N" :y+=1
if d == "S" :y-=1
if d == "E" :x+=1
if d == "W" :x-=1
return (x,y)
def opposite(d):
if d == "N" :return "S"
if d == "S" :return "N"
if d == "E" :return "W"
if d == "W" :return "E"
R = lambda: map(int, input().split())
L = lambda: list(R())
for _ in range(int(input())):
d = defaultdict(set)
x, y = 0, 0
ans = 0
s = input()
for i in s :
if i in d[(x,y)] : ans+=1
else :
d[(x,y)].add(i)
ans+=5
x,y = walk(x,y,i)
d[(x,y)].add(opposite(i))
print(ans)
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
string s;
cin >> s;
set<pair<int,int>> se;
int g=0,d=0,p,h;
int ans=0;
for(auto c: s){
p=d;h=g;
if(c=='N')g++;
else if(c=='S')g--;
else if(c=='W')d--;
else d++;
if(!se.count({p+d,h+g})){
ans+=5;
se.insert({p+d,h+g});
}else ans++;
}
cout<<ans<<endl;
}
return 0;
}119A - Epic Game | 703A - Mishka and Game |
1504C - Balance the Bits | 988A - Diverse Team |
1312B - Bogosort | 1616B - Mirror in the String |
1660C - Get an Even String | 489B - BerSU Ball |
977C - Less or Equal | 1505C - Fibonacci Words |
1660A - Vasya and Coins | 1660E - Matrix and Shifts |
1293B - JOE is on TV | 1584A - Mathematical Addition |
1660B - Vlad and Candies | 1472C - Long Jumps |
1293D - Aroma's Search | 918A - Eleven |
1237A - Balanced Rating Changes | 1616A - Integer Diversity |
1627B - Not Sitting | 1663C - Pōja Verdon |
1497A - Meximization | 1633B - Minority |
688B - Lovely Palindromes | 66B - Petya and Countryside |
1557B - Moamen and k-subarrays | 540A - Combination Lock |
1553C - Penalty | 1474E - What Is It |