#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int y1, int x1, int y2, int x2) {
	bool visit=true;
	int ans=0;
	string s;
	while(visit){
	if(x1==x2&&y1==y2){
		cout<<ans<<endl;
		break;
	}
	if(abs(x1-x2)<2&&abs(y1-y2)<2)
	{
		cout<<"Impossible";
		return;
	}
	else if(x1>=x2&&y1>y2&&(x1-1)>-1&&(y1-2)>-1)	//UL
	{
		x1-=1;
		y1-=2;	
		ans++;
		s+="UL";
	}
	else if(x1<=x2&&y1>y2&&(x1+1)<n&&(y1-2)>-1)	//UR
	{
		x1+=1;
		y1-=2;
		s+="UR";
	}
	else if(x1<x2&&y1==y2&&(x1+2)<n)	//R
	{
		x1+=2;
		ans++;
		s+="R ";
	}
	else if(y1<y2&&x1<=x2&&(x1+1)<n&&(y1+2)<n)	//LR
	{
		x1+=1;
		y1+=2;
		ans++;
		s+="LR";
	}
	else if(y1<y2&&x1>=x2&&(x1-1)>-1&&(y1+2)<n)	//LL
	{
		x1-=1;
		y1+=2;
		ans++;
		s+="LL";
	}
	else if(y1==y2&&x1>x2&&(x1-2)>-1)	//L
	{
		x1-=2;
		ans++;
		s+="L ";
	}
	else
	{
		cout<<"Impossible";
		return;
	}
}
for(int i=0;i<s.length();i+=2){
	cout<<s[i]<<s[i+1]<<' ';
}
}
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;
}