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

//1351C
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Map;
import java.util.TreeMap;

public class Skiers {
    public static void main(String[] args) throws IOException {
        Map<location,Integer> map=new TreeMap<>();
       BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String test_numS = bf.readLine();
        int test_num = Integer.parseInt(test_numS);

        while (test_num > 0) {
            int No=0;
            map.clear();
            map.put(new location(0,0,0,0),No);No++;
            String directionS = bf.readLine();
            char[] direction = directionS.toCharArray();
            location loc[]=new location[direction.length+1];
            for (int i = 0; i <loc.length ; i++) {
                loc[i]=new location();
            }
            int x=0,y=0,prex=0,prey=0;
            int time=0;
            for (int i = 0; i <direction.length ; i++) {
                prex=x;
                prey=y;
                switch (direction[i]){
                    case 'N':
                        x--;
                        break;
                    case 'S':
                        x++;
                        break;
                    case 'W':
                        y--;
                        break;
                    case 'E':
                        y++;
                        break;
                }
              location one=new location(x,y,prex,prey);
                location two=new location(prex,prey,x,y);
                if (!map.containsKey(one)&&!map.containsKey(two)){
                    map.put(one,No);No++;
                    map.put(two,No);No++;
                    time+=5;
                }else time+=1;

            }
            System.out.println(time);
            test_num--;
        }
    }

}
class location implements Comparable<location>{
    int x,y,prex,prey;
    public location(){
    }
    public location(int x,int y,int prex,int prey){
        this.prex=prex;
        this.x=x;
        this.y=y;
        this.prey=prey;
    }

    @Override
    public int compareTo(location o) {
        if(this.x!=o.x)
            return this.x-o.x;
        else if(this.y!=o.y){
            return this.y-o.y;
        }
        else if(this.prex!=o.prex){
            return this.prex-o.prex;
        }
        else return this.prey-o.prey;
    }
}
