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
import sys
input=sys.stdin.readline

def main():
    d={'N':(0,1),'S':(0,-1),'E':(1,0),'W':(-1,0)}
    t=int(input())
    for _ in range(t):
        S=input().strip()
        ans=0
        roads=set()
        p=[0,0]
        for s in S:
            x,y=p
            dx,dy=d[s]
            q=(x,y,x+dx,y+dy)
            r=(x+dx,y+dy,x,y)
            if q in roads or r in roads:
                ans+=1
            else:
                ans+=5
                roads.add((x,y,x+dx,y+dy))
            p[0]+=dx; p[1]+=dy
        sys.stdout.write(str(ans)+'\n')
    
if __name__=='__main__':
    main()