#include <bits/stdc++.h>

using namespace std;

struct que
{
	int x, y, p;
	que(){}
	que(int xx, int yy, int pp){x=xx, y=yy, p=pp;}
} q[202*202]; int t, b; bool f[202][202];

const int mo[2][6] = {{-2,-2, 0, +2,+2,0},{-1,+1,+2,+1,-1,-2}};
string d[]={"UL", "UR", "R", "LR", "LL", "L"};

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    q[++t]=que(i_start, j_start, 0); 
    while(b<t)
    {
		que gg=q[++b]; //cout<<gg.x<<" "<<gg.y<<endl;
		if(gg.x==i_end && gg.y==j_end)break;
		for(int i=0; i<6; ++i)
		{
			int u=q[b].x+mo[0][i];
			int v=q[b].y+mo[1][i];
			if(u>=0&&v>=0&&u<n&&v<n&&!f[u][v])
			{
				f[u][v]=true; //cout<<u<<" "<<v<<endl;
				q[++t]=que(u, v, b);
			}
		}
	}
	if(q[b].x!=i_end || q[b].y!=j_end) cout << "Impossible"; else
	{
		vector<string> res;
		while(b>0)
		{
			int gg=q[b].p; if(gg==0)break;
			for(int i=0; i<6; ++i)	
			{
				int u=q[gg].x+mo[0][i];
				int v=q[gg].y+mo[1][i];
				if(u>=0&&v>=0&&u<n&&v<n&&u==q[b].x&&v==q[b].y)res.push_back(d[i]);
			}
			b=gg;
		}
		cout<<res.size()<<endl;
		for(int i=(int)res.size()-1; i>=0; --i)cout<<res[i]<<" ";
	}
}

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;
}