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

/* Name of the class has to be "Main" only if the class is public. */
public class Skier
{
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    
    static int getInt() throws Exception {
         String str=br.readLine();
         int n=0;
         if(str!=null)
            n = Integer.parseInt(str);
        return n;
    }
    
    static String getString() throws Exception {
         String str=br.readLine();
            return str;
    }
    
    static boolean check(int T) throws Exception {
        
        if(T<=0 && T>10000)
            return false;
        else
            return true;
    }
    
    static boolean checker(int T) throws Exception {
        
        if(T<=0 && T>100000)
            return false;
        else
            return true;
        }
        
	public static void main (String[] args) throws java.lang.Exception
	{
		int T = 0;
		T = getInt();
		if(check(T)) {
		for(int tt=1;tt<=T;tt++)
		{
		    String k = getString();
		    if(checker(k.length()) && k!=null) {
		        char[] c = k.toCharArray();
		        HashSet<String> set = new HashSet<>();
		        int xve = 0,xne = 0,yve = 0,yne = 0,ans=0;
		        //set.add("0000");
		        for(int i=0;i<c.length;i++)   {
		                xne=xve;
		                yne=yve;
		            if(c[i]=='N')
		                yve++;
		            else if(c[i]=='S')
		                yve--;
		            else if(c[i]=='E')
		                xve++;
		            else if(c[i]=='W')
		                xve--;
		                
		                String val = String.valueOf(xne)+'_'+String.valueOf(xve)+'_'+String.valueOf(yve)+'_'+String.valueOf(yne);
		                String val1 = String.valueOf(xve)+'_'+String.valueOf(xne)+'_'+String.valueOf(yne)+'_'+String.valueOf(yve);
		                
		               // System.out.println(val);
		                //System.out.println(set);
		                if(set.contains(val) || set.contains(val1))
		                    ans++;
		                else    {
		                     //System.out.println(set);
		                    set.add(val);
		                    set.add(val1);
		                    // System.out.println(set);
		                    ans+=5;
		                }
		           
		        }
		        System.out.println(ans);
		    }
		}
		}
	}
}
