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

public class CodingLegacy {

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Palindrome solver = new Palindrome();

        int t = 1;
        t = in.nextInt();

        for (int i = 0; i < t; i++) {
            solver.solve(i + 1, in, out);
        }

        out.close();
    }

    static class Palindrome {
        static long mod = 1000000007;
        static long maxX = (long) 1e18;
        static long mod2 = 998244353;

        void solve(int testNumber, ScanReader in, PrintWriter out) {
            char[] s = in.next().toCharArray();

            HashSet<String> set = new HashSet<>();
            long ans = 0;
            int x = 0,y = 0;
            int n = s.length;
            for(int i = 0;i<n;i++) {
                if(s[i] == 'N') {

                    int x1 = x,y1 = y;
                    y++;
                    String temp = "" + x1 + " " + y1 + " " + x + " " + y;
                    String temp2 = "" + x + " " + y + " " + x1 + " " + y1;

                    if(set.contains(temp) || set.contains(temp2)) {
                        ans++;
                    } else {
                        ans += 5;
                        set.add(temp);
                        set.add(temp2);
                    }

                } else if (s[i] == 'S') {

                    int x1 = x,y1 = y;
                    y--;
                    String temp = "" + x1 + " " + y1 + " " + x + " " + y;
                    String temp2 = "" + x + " " + y + " " + x1 + " " + y1;

                    if(set.contains(temp) || set.contains(temp2)) {
                        ans++;
                    } else {
                        ans += 5;
                        set.add(temp);
                        set.add(temp2);
                    }

                } else if (s[i] == 'E') {

                    int x1 = x,y1 = y;
                    x--;
                    String temp = "" + x1 + " " + y1 + " " + x + " " + y;
                    String temp2 = "" + x + " " + y + " " + x1 + " " + y1;

                    if(set.contains(temp) || set.contains(temp2)) {
                        ans++;
                    } else {
                        ans += 5;
                        set.add(temp);
                        set.add(temp2);
                    }

                } else {

                    int x1 = x,y1 = y;
                    x++;
                    String temp = "" + x1 + " " + y1 + " " + x + " " + y;
                    String temp2 = "" + x + " " + y + " " + x1 + " " + y1;

                    if(set.contains(temp) || set.contains(temp2)) {
                        ans++;
                    } else {
                        ans += 5;
                        set.add(temp);
                        set.add(temp2);
                    }
                }

            }

            out.println(ans);
        }
    }

    static class ScanReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        public ScanReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

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

        public int nextInt() {
            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;

            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
            return res * sgn;
        }

        public double nextDouble() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            }
            while (!isSpaceChar(c));

            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return readString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
}