Travelling on foot in a metropolis is harder than you imagine, especially when you are required to cross a road with absolutely busy traffic.
Imagine you are trying to cross a road with $$$N + 2$$$ lanes, with no traffic islands in between. The lanes are numbered from $$$0$$$ to $$$N + 1$$$, from nearest to farthest. For each lane $$$i$$$ ($$$1 \leq i \leq N$$$), there will be exactly one car approaching on each lane from the left, expecting to arrive at time $$$T_i$$$. There are no cars on lane $$$0$$$ and lane $$$N + 1$$$.
You would like to cross the road by only moving forward. You start at lane $$$0$$$ at time $$$0$$$. For each lane $$$i$$$ ($$$1 \leq i \leq N$$$), you will wait at lane $$$i - 1$$$ before stepping onto lane $$$i$$$.
Suppose you just stepped on lane $$$i - 1$$$ at time $$$t$$$. You can immediately choose to either look left or look right. The time you move forward will then be determined as follows:
After you step onto lane $$$N$$$ at time $$$t$$$, you will step onto lane $$$N + 1$$$ at time $$$t + 1$$$.
You are considered hit by a car if you are still staying at lane $$$i$$$ at time $$$T_i$$$, which means you have stepped onto lane $$$i$$$ no later than time $$$T_i$$$ but decided to step onto lane $$$i + 1$$$ after time $$$T_i$$$.
For each lane, can you decide whether to look left or look right so that you can step onto lane $$$N + 1$$$ safely?
The first line of input consists of a single integer $$$N$$$ ($$$1 \leq N \leq 10^5$$$), the number of lanes with cars.
The second line of input consists of $$$N$$$ integers $$$T_i$$$ ($$$1 \leq T_i \leq 10^9$$$), the timings when the cars are approaching.
If it is not possible to reach lane $$$N + 1$$$, output Impossible.
Otherwise, output a string of $$$N$$$ characters, consisting of L and R only. The $$$i$$$-th character ($$$1 \leq i \leq N$$$) should be L if you decided to look left at lane $$$i - 1$$$, and R if you decided to look right at lane $$$i - 1$$$.
If there are multiple ways to reach lane $$$N + 1$$$, you may output any of them.
31 5 5
LRR
108 8 8 8 8 8 8 8 8 8
Impossible
For the first sample test, the output LRR corresponds to the following crossing strategy:
The output LLL is also acceptable, corresponding to the following crossing strategy:
However, the output LRL is unacceptable for the following reason:
| Name |
|---|


