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
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    t=int(readline())
    res=[]
    for _ in range(t):
        s=readline().strip()
        dNS=dict()
        dWE=dict()

        count=0
        y=0
        x=0
        for c in s:
            if c=="N":
                a=str(x)+"_"+str(y)
                y+=1
                b=str(x)+"_"+str(y)
                flag=1
            elif c=="S":
                b=str(x)+"_"+str(y)
                y-=1
                a=str(x)+"_"+str(y)
                flag=1
            elif c=="W":
                b=str(x)+"_"+str(y)
                x-=1
                a=str(x)+"_"+str(y)
                flag=0
            elif c=="E":
                a=str(x)+"_"+str(y)
                x+=1
                b=str(x)+"_"+str(y)
                flag=0
            c=a+"_"+b

            if flag==1:
                if c not in dNS:
                    count+=5
                    dNS[c]=1
                else:
                    count+=1
            else:
                if c not in dWE:
                    count+=5
                    dWE[c]=1
                else:
                    count+=1
        
        res.append(count)
    
    for i in range(t):
        print(res[i])

if __name__=="__main__":
    main()