Circular Move

You have a robot currently standing at the origin (0, 0) of a two-dimensional grid and facing north direction. You are given a sequence of moves for the robot in the form of a string of size 'N'. You are required to find whether the path followed by the robot upon taking the moves is circular or not.

A sequence of moves is circular if and only if the robot ends up from where it initially started.

The sequence of moves contains only three types of moves.

'G': it means that the robot will move 1 unit in the direction it is facing.

'L': it means that the robot will move 90 degrees towards its left. For example, if the robot is facing north and it has to make an ‘L’ move, then it will start facing the west direction.

'R': it means the robot will move 90 degrees towards its right. For example, if the robot is facing north and it has to make an ‘R’ move then it will start facing the east direction.

Input Format:

The first line contains an integer 'T' which denotes the number of test cases/queries to be run. 
Then the test cases follow. 

The first and the only line of input for each test case/query contains a string representing the sequence of moves.

Note:

The sequence of moves will always be:
1. A valid one.

2. In uppercase characters without spaces in between.

Output Format:

For each test case, print a single line containing ‘True’ if the sequence of moves is circular, print ‘False’ otherwise(without quotes).

The output for every test case will be printed in a separate line.

Note:

You do not need to print anything, it has already been taken care of. Just implement the function.

Constraints:

1 <= T <= 100
0 <= N <= 10 ^ 4

All the characters of the string will be ‘L’, ‘R’, and ‘G’.

Time Limit: 1 sec.