#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int x1, int y1, int x2, int y2) {
    vector <string> x;
    //  Print the distance along with the sequence of moves.
    int s=0,f=0;
	if(abs(x1-x2)%2==1||(abs(x1-x2)==0&&abs(y1-y2)==1)||(abs(x1-x2)==1&&abs(y1-y2)==0)||(abs(x1-x2)==1&&abs(y1-y2)==1)||x1<0||x1>n-1||y1<0||y1>n-1||x2<0||x2>n-1||y2<0||y2>n-1)
	cout<<"Impossible"; else{
		while(!(x1==x2&&y1==y2)){
			if((abs(x1-x2)==0&&abs(y1-y2)==1)||(abs(x1-x2)==1&&abs(y1-y2)==0)||(abs(x1-x2)==1&&abs(y1-y2)==1)||x1<0||x1>n-1||y1<0||y1>n-1){
				cout<<"Impossible"<<endl;
				f++;
				break;
			} if(x1==x2){
				if(y1>y2){
					y1-=2;
					s++;
					//cout<<"L"<<endl;
					x.push_back("L");
					continue;
				}else{
					y1+=2;
					s++;
					//cout<<"R"<<endl;
					x.push_back("R");
					continue;
				}
			} else if(x1>x2){
				if(y1>y2){
					y1-=1;
					x1-=2;
					s++;
					//cout<<"UL"<<endl;
					x.push_back("UL");
					continue;
				}else{
					y1+=1;
					x1-=2;
					s++;
					//cout<<"UR"<<endl;
					x.push_back("UR");
					continue;
				}
				}else{
					if(y1>y2){
						y1-=1;
					x1+=2;
					s++;
					//cout<<"LL"<<endl;
					x.push_back("LL");
					continue;
				}else{
					y1+=1;
					x1+=2;
					s++;
					//cout<<"LR"<<endl;
					x.push_back("LR");
					continue;
				}
				}
			}
			if(f==0){
				//cout<<x1<<" "<<y1<<endl;
				cout<<s<<endl;
				for(int k=0;k<x.size();k++)
				cout<<x[k]<<" ";
			}
		}
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}