Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

Problem hidden

MUSTR - Muski Trouble

no tags 

Little Muski went to the candy shop . sit there ,eat candy and forgot the way to her home . she is crying and there is nobody to help her. Muski being brave decide to move from the candy shop. In the first she moves in the right side of the shop by a distance of 1KM. and then in the subsequent hours move double of the distance as moved in the previous hour but in opposite direction (for second hour it being left side) . Unfortunately she is not able find her home. Brekish , worried of his Little Muski start finding Her . He know that she went to candy shop. he go there and not find anything.

Your task is to help Brekish find Muski by telling him the direction and number of kilometers muski is away with respect to the candy shop.

 

 

Input

First line of the input (N) denotes number of testcases, for next n line that follows there is a number M denotes number of hours after which rahul needs your help. The M is the numberof hours passed after which muski started moving.

Output

You Have to output distance of muski relative to candy shop and the direction in single line with a white space. (L)denotes Left side And (R) denotes right side of the candy shop.

Example

Input:
3
1
3
5
Output:
1 R
3 R
11 R

Added by:JUNK
Date:2016-10-12
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU