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
test = int(input());
while(test):
    test-=1;
    s=input();
    x=0;
    y=0;
    ls=set();
    
    
    # pos=[[0]*1000]*1000;
    # neg =[[0]*1000]*1000
    # pos1=[[0]*1000]*1000;
    # neg4 =[[0]*1000]*1000
    # pos[0][0]=1;
    # neg4[0][0]=1
    # pos1[0][0]=1
    # neg[0][0]=1
    # xm=[0,0];ym=[0,0];
    
    ans=0;
    for i in s:
        
        tx=x;ty=y;
        if(i=='N'):
            x+=1;
        if(i=='S'):
            x-=1;
        if(i=='E'):
            y+=1;
        if(i=='W'):
            y-=1;
        # t = list(set(map(tuple,ls)))
        
        if(tuple((tx,ty,x,y)) not in ls):
            ans+=5;
            ls.add(tuple((tx,ty,x,y)));
            ls.add(tuple((x,y,tx,ty)));
            
        else:
            ans+=1;
            
    print(ans)
                