import java.lang.Math;
import java.util.Scanner;
 
class submission{
  // pyramid[r][c] containts the element in row r and column c for 0 <= c <= r < n.
  public static int max_path(int[][] pyramid, int n) {
    return 1;
  }
 
  public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int n = in.nextInt();
    int[][] pyramid = new int[n][n];
    for (int i=0; i<n; i++)
      for (int j=0; j<=i; j++)
        pyramid[i][j]=in.nextInt();
 
    System.out.println(max_path(pyramid, n));
 
    // output solution
    for (int i=1; i<n; i++) {
      System.out.print("L");
    }
    System.out.println();
  }
}
 

aW1wb3J0IGphdmEubGFuZy5NYXRoOwppbXBvcnQgamF2YS51dGlsLlNjYW5uZXI7CgpjbGFzcyBzdWJtaXNzaW9uewogIC8vIHB5cmFtaWRbcl1bY10gY29udGFpbnRzIHRoZSBlbGVtZW50IGluIHJvdyByIGFuZCBjb2x1bW4gYyBmb3IgMCA8PSBjIDw9IHIgPCBuLgogIHB1YmxpYyBzdGF0aWMgaW50IG1heF9wYXRoKGludFtdW10gcHlyYW1pZCwgaW50IG4pIHsKICAgIHJldHVybiAxOwogIH0KCiAgcHVibGljIHN0YXRpYyB2b2lkIG1haW4oU3RyaW5nW10gYXJncykgewogICAgU2Nhbm5lciBpbiA9IG5ldyBTY2FubmVyKFN5c3RlbS5pbik7CiAgICBpbnQgbiA9IGluLm5leHRJbnQoKTsKICAgIGludFtdW10gcHlyYW1pZCA9IG5ldyBpbnRbbl1bbl07CiAgICBmb3IgKGludCBpPTA7IGk8bjsgaSsrKQogICAgICBmb3IgKGludCBqPTA7IGo8PWk7IGorKykKICAgICAgICBweXJhbWlkW2ldW2pdPWluLm5leHRJbnQoKTsKCiAgICBTeXN0ZW0ub3V0LnByaW50bG4obWF4X3BhdGgocHlyYW1pZCwgbikpOwoKICAgIC8vIG91dHB1dCBzb2x1dGlvbgogICAgZm9yIChpbnQgaT0xOyBpPG47IGkrKykgewogICAgICBTeXN0ZW0ub3V0LnByaW50KCJMIik7CiAgICB9CiAgICBTeXN0ZW0ub3V0LnByaW50bG4oKTsKICB9Cn0K

NQo3CjMgOAo4IDEgMAoyIDcgNCA0CjQgNSAyIDYgNQo=

5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5