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 java.io.*;
import java.util.*;

public class Codeforces
{
    public static void main(String args[])throws Exception
    {
        BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb=new StringBuilder();
        int t=Integer.parseInt(bu.readLine());
        while(t-->0)
        {
            char s[]=bu.readLine().toCharArray();
            int n=s.length,cx=0,cy=0,i,ans=0;
            Set<ArrayList<Integer>> set=new HashSet<>();
            for(i=0;i<n;i++)
            {
                int sz=set.size(),nx=cx,ny=cy;
                ArrayList<Integer> tem=new ArrayList<>();
                if(s[i]=='E') nx++;
                if(s[i]=='W') nx--;
                if(s[i]=='N') ny++;
                if(s[i]=='S') ny--;
                tem.add(cx); tem.add(cy); tem.add(nx); tem.add(ny);
                set.add(tem);
                if(set.size()==sz) ans++;
                else ans+=5;
                tem=new ArrayList<>();
                tem.add(nx); tem.add(ny); tem.add(cx); tem.add(cy);
                set.add(tem);
                cx=nx; cy=ny;
            }
            sb.append(ans+"\n");
        }
        System.out.print(sb);
    }
}

