#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
bool flag=0;
vector<string> pa;
long int ans=1000000005;
void fun(int n, int x1, int y1, int x, int y,long int steps,bool c[][300],vector<string> path,string s,int x2,int y2)
{
    if(x1<0||y1<0||x1>=n||y1>=n||c[x1][y1]||abs(x1-x)%2==1)
    {
        return;
    }
    if(abs(x1-x)>x2||abs(y1-y)>y2)
    {
        return;
    }
    path.push_back(s);
    c[x1][y1]=1;
    x2=abs(x1-x);
    y2=abs(y1-y);
    if(x1==x&&y1==y)
    {
        if(steps<ans)
        {
            ans=steps;
            pa.assign(path.begin(),path.end());
        }
        flag=1;
    }
    if(x1==x)
    {
        if(y1>y)
        {
            steps+=(y1-y)/2;
            for(int j=0;j<(y1-y)/2;j++)
            {
                path.push_back("L");
            }
            if(steps<ans)
            {
            ans=steps;
            pa.assign(path.begin(),path.end());
            }
            flag=1;
            return;
        }
        if(y1<y)
        {
            steps+=(y-y1)/2;
            for(int j=0;j<(y-y1)/2;j++)
            {
                path.push_back("R");
            }
            if(steps<ans)
            {
            ans=steps;
            pa.assign(path.begin(),path.end());
            }
            flag=1;
            return;
        }
    }
    if(y1==y)
    {
        if((abs(x1-x)/2)%2==1)
        {
            return;
        }
        if(x1>x)
        {
            steps+=(x1-x)/2;
            for(int j=0;j<(x1-x)/4;j++)
            {
                path.push_back("LR");
                path.push_back("LL");
            }
            if(steps<ans)
            {
            ans=steps;
            pa.assign(path.begin(),path.end());
            }
            flag=1;
            return;
        }
        if(x1<x)
        {
            steps+=(x-x1)/2;
            for(int j=0;j<(x-x1)/4;j++)
            {
                path.push_back("LR");
                path.push_back("LL");
            }
            if(steps<ans)
            {
            ans=steps;
            pa.assign(path.begin(),path.end());
            }
            flag=1;
            return;
        }
    }
    
    fun(n,x1-2,y1-1,x,y,steps+1,c,path,"UL",x2,y2);
    fun(n,x1-2,y1+1,x,y,steps+1,c,path,"UR",x2,y2);
    fun(n,x1,y1+2,x,y,steps+1,c,path,"R",x2,y2);
    fun(n,x1+2,y1+1,x,y,steps+1,c,path,"LR",x2,y2);
    fun(n,x1+2,y1-1,x,y,steps+1,c,path,"LL",x2,y2);
    fun(n,x1,y1-2,x,y,steps+1,c,path,"L",x2,y2);
    c[x1][y1]=0;
    
}

int main() {
    int n;
    cin>>n;
    vector<string> path;
    long int steps=0;
    bool c[300][300];
    for(int i=0;i<202;i++)
    {
        for(int j=0;j<202;j++)
        {
            c[i][j]=0;
        }
    }
    int x1,y1,x,y;
    cin>>x1>>y1>>x>>y;
    if(abs(x1-x)%2==1)
    {
        cout<<"Impossible"<<endl;
        return 0;
    }
    int latestx=abs(x1-x),latesty=abs(y1-y);
    fun(n,x1,y1,x,y,steps,c,path,"0",latestx,latesty);
    if(flag==0)
    {
        cout<<"Impossible"<<endl;
        return 0;
    }
    cout<<ans<<endl;
    for(auto it=pa.begin()+1;it!=pa.end();it++)
    {
        cout<<*it<<" ";
    }
    return 0;
}