import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.Arrays; import java.util.InputMismatchException; import java.util.Queue; public class B { InputStream is; PrintWriter out; String INPUT = ""; // UL, UR, R, LR, LL, L String[] DD = "UL UR R LR LL L".split(" "); int[] dr = {-2, -2, 0, 2, 2, 0}; int[] dc = {-1, 1, 2, 1, -1, -2}; void solve() { int n = ni(); int sr = ni(), sc = ni(); int tr = ni(), tc = ni(); int[][] dt = d(tr, tc, n); int[][] ds = d(sr, sc, n); if(ds[tr][tc] > 99990){ out.println("Impossible"); return; } out.println(ds[tr][tc]); int r = sr, c = sc; while(!(r == tr && c == tc)){ for(int k = 0;k < 6;k++){ int nr = r + dr[k], nc = c + dc[k]; if(nr >= 0 && nr < n && nc >= 0 && nc < n && ds[nr][nc] == ds[r][c] + 1 && ds[nr][nc] + dt[nr][nc] == ds[tr][tc]){ out.print(DD[k] + " "); r = nr; c = nc; break; } } } out.println(); } int[][] d(int sr, int sc, int n) { int[][] d = new int[n][n]; for(int i = 0;i < n;i++){ Arrays.fill(d[i], 99999); } d[sr][sc] = 0; Queue q = new ArrayDeque<>(); q.add(new int[]{sr, sc}); while(!q.isEmpty()){ int[] cur = q.poll(); int r = cur[0], c = cur[1]; for(int k = 0;k < 6;k++){ int nr = r + dr[k], nc = c + dc[k]; if(nr >= 0 && nr < n && nc >= 0 && nc < n && d[nr][nc] > d[r][c] + 1){ d[nr][nc] = d[r][c] + 1; q.add(new int[]{nr, nc}); } } } return d; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new B().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }