Sherlock is following N criminals, which are right now in a 2D grid. Each criminal at t=0, decides to move in certain fixed direction. Each criminal moves with same speed. These fixed directions are North, East, West and South. Two or more criminals, however, vanish whenever they meet at any place at same time, t>0.

You have to tell what is the final number of criminals left at t=infinity.

Note: No two criminals will have the same starting point at t=0.

Input
First line, T, the number of testcases. Each testcase consists of N lines. Each line contains x y z. x, y denotes the intial position of the criminal. z is one of 'N','E','W','S', denoting the direction in which this criminal will move.

Output
For each testcase, required answer in one line.

Constraints
1 ≤ T ≤ 100
1 ≤ N ≤ 50
-1000 ≤ x, y ≤ 1000