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
t=int(input())
for i in range(t):
    s=str(input())
    n=len(s)
    lis=[0,0]
    dict={}
    ans=0
    for j in range(n):
        tuple1=(lis[0],lis[1])
        if s[j]=="W":
            lis[0]-=1
        if s[j]=="E":
            lis[0]+=1
        if s[j]=="N":
            lis[1]+=1
        if s[j]=="S":
            lis[1]-=1
        tuple2=(lis[0],lis[1])
        tuple3=(tuple1,tuple2)
        tuple4=(tuple2,tuple1)
        if tuple3 in dict.keys() or tuple4 in dict.keys():
            ans+=1
        else:
            dict[tuple3]=1
            dict[tuple4]=1
            ans+=5
    print(ans)