Problem: The New Year is coming! That's why many people today are busy preparing New Year presents. Vasily the Programmer is no exception.

Vasily knows that the best present is (no, it's not a contest) money. He's put n empty wallets from left to right in a row and decided how much money to put in what wallet. Vasily decided to put ai coins to the i-th wallet from the left.

Vasily is a very busy man, so the money are sorted into the bags by his robot. Initially, the robot stands by the leftmost wallet in the row. The robot can follow instructions of three types: go to the wallet that is to the left of the current one (if such wallet exists), go to the wallet that is to the right of the current one (if such wallet exists), put a coin to the current wallet. Due to some technical malfunctions the robot cannot follow two "put a coin" instructions in a row.

Vasily doesn't want to wait for long, so he wants to write a program for the robot that contains at most 106 operations (not necessarily minimum in length) the robot can use to put coins into the wallets. Help him.

Input

The first line contains integer n (2 ≤ n ≤ 300) — the number of wallets. The next line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 300).

It is guaranteed that at least one ai is positive.

Output

Print the sequence that consists of k (1 ≤ k ≤ 106) characters, each of them equals: "L", "R" or "P". Each character of the sequence is an instruction to the robot. Character "L" orders to move to the left, character "R" orders to move to the right, character "P" orders the robot to put a coin in the wallet. The robot is not allowed to go beyond the wallet line. In other words, you cannot give instructions "L" if the robot is at wallet 1, or "R" at wallet n.

As a result of the performed operations, the i-th wallet from the left must contain exactly ai coins. If there are multiple answers, you can print any of them.

Examples

Input

2
1 2


Output

PRPLRP

Input

4
0 2 0 2


Output

RPRRPLLPLRRRP

Solution (in PYTHON):

Solution:
import sys
n = int(raw_input())
wallets = map(lambda x: int(x), raw_input().split())
coinsLeft = sum(wallets)
pos = 0

def move(dir):
  sys.stdout.write(dir)

def findClosest(pos, walls):
  if coinsLeft == walls[pos]: return None
  l = pos 
  r = pos
  while l >= 0 or r < len(walls):
    if walls[l] != 0: return l
    if walls[r] != 0: return r
    if l > 0: l -= 1
    if r < len(walls) - 1: r += 1

closest = 0
while coinsLeft > 0:
  if wallets[pos] > 0:  
    move("P")
    wallets[pos] = wallets[pos] - 1
    coinsLeft -= 1
  if coinsLeft == 0: break
  if closest == pos:
    closest = findClosest(pos, wallets) 
    if closest == None or closest == pos:
      closest = filter(lambda x: x >= 0 and x < len(wallets), [pos - 1, pos + 1])[0]
  if closest < pos:
    move("L")
    pos -= 1
  if closest > pos:
    move("R")
    pos += 1