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 \le t \le 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
rilist = lambda :[int(i) for  i  in  input().split()]
rlist = lambda :[i for  i  in  input().split()]
rint = lambda: int(input())
rfloat = lambda: float(input())
def pmat(mat):
    for i in range(len(mat)):
        a = ' '.join(map(str, mat[i]))
        print(a)
    print()

d = {'N':(1,0),'S':(-1,0),'E':(0,1),'W':(0,-1)}
def solve(t):
    path = input()
    curr = (0, 0)
    tmp = {}
    res = 0
    for p in path:
        a,b = d[p]
        next = (curr[0]+a,curr[1]+b)
        key = sorted((curr, next), key=lambda x:x[0])
        key = sorted(key, key=lambda x:x[1])
        key = tuple(key)
        curr = next
        res += tmp.get( key ,5)
        tmp[key]=1
    print(res)
test = int(input())
for tc in range(test):
    solve(tc+1)
rilist = lambda :[int(i) for  i  in  input().split()]
rlist = lambda :[i for  i  in  input().split()]
rint = lambda: int(input())
rfloat = lambda: float(input())
def pmat(mat):
    for i in range(len(mat)):
        a = ' '.join(map(str, mat[i]))
        print(a)
    print()

d = {'N':(1,0),'S':(-1,0),'E':(0,1),'W':(0,-1)}
def solve(t):
    path = input()
    curr = (0, 0)
    tmp = {}
    res = 0
    for p in path:
        a,b = d[p]
        next = (curr[0]+a,curr[1]+b)
        key = sorted((curr, next), key=lambda x:x[0])
        key = sorted(key, key=lambda x:x[1])
        key = tuple(key)
        curr = next
        res += tmp.get( key ,5)
        tmp[key]=1
    print(res)
test = int(input())
for tc in range(test):
    solve(tc+1)