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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Skier {
    public static void main(String[] args) {
        FastReader input=new FastReader();
        int t=input.nextInt();
        while(t-->0)
        {
            String s=input.next();
            int x1=0,y1=0,x2=0,y2=0;
            HashSet<String> set=new HashSet<>();
            int path=0;
            for(int i=0;i<s.length();i++)
            {
                if(s.charAt(i)=='N')
                {
                    y2++;
                }
                else if(s.charAt(i)=='S')
                {
                    y2--;
                }
                else if(s.charAt(i)=='E')
                {
                    x2++;
                }
                else
                {
                    x2--;
                }
                String path1=x1+" "+y1+" "+x2+" "+y2;
                String path2=x2+" "+y2+" "+x1+" "+y1;
                if(set.contains(path1) || set.contains(path2))
                {
                    path++;
                }
                else
                {
                    path+=5;
                }
                set.add(path1);
                x1=x2;
                y1=y2;
            }
            System.out.println(path);
        }

    }
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}
