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.HashSet;
import java.util.Scanner;
import java.util.Set;

public class C1351 {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        for (int t=0; t<T; t++) {
            char[] S = in.next().toCharArray();
            int x = 0;
            int y = 0;
            int answer = 0;
            Set<Segment> set = new HashSet<>();
            for (char c : S) {
                Segment segment;
                if (c == 'N') {
                    segment = new Segment(x, y, false);
                    y++;
                } else if (c == 'S') {
                    y--;
                    segment = new Segment(x, y, false);
                } else if (c == 'E') {
                    x--;
                    segment = new Segment(x, y, true);
                } else {
                    segment = new Segment(x, y, true);
                    x++;
                }
                answer += set.add(segment) ? 5 : 1;
            }
            System.out.println(answer);
        }
    }

    static class Segment {
        private int x;
        private int y;
        private boolean horizontal;

        Segment(int x, int y, boolean horizontal) {
            this.x = x;
            this.y = y;
            this.horizontal = horizontal;
        }

        @Override
        public int hashCode() {
            int hash = 7;
            hash = 41 * hash + this.x;
            hash = 41 * hash + this.y;
            hash = 41 * hash + (this.horizontal ? 1 : 0);
            return hash;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Segment other = (Segment) obj;
            if (this.x != other.x) {
                return false;
            }
            if (this.y != other.y) {
                return false;
            }
            if (this.horizontal != other.horizontal) {
                return false;
            }
            return true;
        }

    }

}
