#include <bits/stdc++.h>
using namespace std;
struct cell
{
	int x,y,dis;
	string path;
    cell() {}
	cell(int x,int y,int dis,string path): x(x),y(y),dis(dis),path(path) {}
};

bool isIn(int x,int y,int n)
{
	if(x>=0 && x<n && y>=0 && y<n)
		return true;
	return false;
}

void minStep(int knight[],int target[],int n)
{
	int dx[]={-2,-2,0,2,2,0};
    int dy[]={-1,1,2,1,-1,-2};
	string pa[]={"UL","UR","R","LR","LL","L"};
    queue<cell> q;
    string pos="";
    q.push(cell(knight[0],knight[1],0,pos));
    cell t;
    int x,y;
    bool visit[n][n];

    for(int i=0;i<n;i++)
    	for(int j=0;j<n;j++)
    		visit[i][j]=false;

    int flag=0;
    while(!q.empty())
    {
    	t=q.front();
    	q.pop();
    	visit[t.x][t.y]=true;	
    	if(t.x==target[0] && t.y==target[1])
    	{
    		cout<<t.dis<<"\n"<<t.path;
    		flag=1;
    		break;
    	}
    	for(int i=0;i<6;i++)
    	{
    		x=t.x+dx[i];
    		y=t.y+dy[i];
    	    pos=t.path+pa[i]+" ";
    		if(isIn(x,y,n) && visit[x][y]==false)
    		{
    			q.push(cell(x,y,t.dis+1,pos));
			}
    	}
    }
    if(!flag)
    	cout<<"Impossible";
}
int main()
{
	int n;
	cin>>n;
	int sx,sy,ex,ey;
	int knight[2],target[2];
	cin>>knight[0]>>knight[1]>>target[0]>>target[1];
	minStep(knight,target,n);
}