import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

	static int n,is,js,ie,je;
	static ArrayList<String> defal=new ArrayList<>(Collections.nCopies(200, ""));
	static ArrayList<String> path=new ArrayList<>();
	static int[][] a;
	static boolean isvalid(int i,int j){
		if(i>=0 && i<n && j>=0 && j<n && a[i][j]!=1) return true;
		return false;
	}
	static ArrayList<String> makepath(int i,int j,String dir){
		if(i==ie && j==je){
			ArrayList<String> al=new ArrayList<>();
			al.add(dir);
			return al;
		}
		a[i][j]=1;
		PriorityQueue<ArrayList<String>> heap=new PriorityQueue<>((a,b)->a.size()-b.size());
		//ArrayList<String> minsizeal=defal;
		ArrayList<String> ulal=new ArrayList<>();
		ArrayList<String> ural=new ArrayList<>();
		ArrayList<String> ral=new ArrayList<>();
		ArrayList<String> lral=new ArrayList<>();
		ArrayList<String> llal=new ArrayList<>();
		ArrayList<String> lal=new ArrayList<>();
		//System.out.println(defal.size());
		if(isvalid(i-2,j-1)){
			ulal=makepath(i-2,j-1,"UL");
			if(ulal.size()!=0){
				ulal.add(dir);
				//if(ulal.size()<minsizeal.size()) minsizeal=ulal;
				heap.add(ulal);
			}
			//System.out.println(ulal);
		}
		if(isvalid(i-2,j+1)){
			ural=makepath(i-2,j+1,"UR");
			if(ural.size()!=0){
				ural.add(dir);
				//if(ural.size()<minsizeal.size()) minsizeal=ural;
				heap.add(ural);
			}
			//System.out.println(ural);
		}
		if(isvalid(i,j+2)){	
			ral=makepath(i,j+2,"R");
			if(ral.size()!=0){
				ral.add(dir);
				//if(ral.size()<minsizeal.size()) minsizeal=ral;
				heap.add(ral);
			}
			//System.out.println(ral);
		}
		if(isvalid(i+2,j+1)){
			lral=makepath(i+2,j+1,"LR");
			if(lral.size()!=0){
				lral.add(dir);
				//if(lral.size()<minsizeal.size()) minsizeal=lral;
				heap.add(lral);
			}
			//System.out.println(lral);
		}
		if(isvalid(i+2,j-1)){
			llal=makepath(i+2,j-1,"LL");
			if(llal.size()!=0){
				llal.add(dir);
				//if(llal.size()<minsizeal.size()) minsizeal=llal;
				heap.add(llal);
			}
			//System.out.println(llal);
		}
		if(isvalid(i,j-2)){
			lal=makepath(i,j-2,"L");
			if(lal.size()!=0){
				lal.add(dir);
				//if(lal.size()<minsizeal.size()) minsizeal=lal;
				heap.add(lal);
			}
			//System.out.println(lal);
		}
		a[i][j]=0;
		if(heap.size()==0) return new ArrayList<String>();
		else return heap.peek();
	}
    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    	ArrayList<String> path=makepath(i_start,j_start,"start");
    	if(path.size()==0) System.out.println("Impossible");
    	else{
    		System.out.println(path.size()-1);
    		for(int i=path.size()-2;i>=0;i--){
    			System.out.print(path.get(i)+" ");
    		}
    		
    	}
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        is = in.nextInt();
        js = in.nextInt();
        ie = in.nextInt();
        je = in.nextInt();
        a=new int[n][n];
        if(is==ie && js==je) System.out.println("0");
        else printShortestPath(n, is, js, ie, je);
        in.close();
    }
}