#include <bits/stdc++.h>

using namespace std;

vector<string> v;
int x[6]={-2,-2,0,2,2,0};
int y[6]={1,-1,-2,-1,1,2};
string a[6]={"UR","UL","L","LL","LR","R"};
int r=10000;

void find(int n, int i_start, int j_start, int i_end, int j_end,int c,vector<string> s)
{
    if(i_start==i_end && j_start==j_end && c<r)
    {
        r=c;
        v=s;
        return ;
    }
    if(j_start<j_end && i_start>i_end)
    {
        s.push_back(a[0]);
        find(n,i_start+x[0],j_start+y[0],i_end,j_end,c+1,s);
        s.pop_back();
    }
    if(j_start>=j_end && i_start>i_end)
    {
        s.push_back(a[1]);
        find(n,i_start+x[1],j_start+y[1],i_end,j_end,c+1,s);
        s.pop_back();
    }
    if(j_start>j_end && i_start==i_end)
    {
        s.push_back(a[2]);
        find(n,i_start+x[2],j_start+y[2],i_end,j_end,c+1,s);
        s.pop_back();
    }
    if(j_start>j_end && i_start<i_end)
    {
        s.push_back(a[3]);
        find(n,i_start+x[3],j_start+y[3],i_end,j_end,c+1,s);
        s.pop_back();
    }
    if(j_start<=j_end && i_start<i_end)
    {
        s.push_back(a[4]);
        find(n,i_start+x[4],j_start+y[4],i_end,j_end,c+1,s);
        s.pop_back();
    }
    if(j_start<j_end && i_start==i_end)
    {
        s.push_back(a[5]);
        find(n,i_start+x[5],j_start+y[5],i_end,j_end,c+1,s);
        s.pop_back();
    }
    return ;
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    if(abs(i_start-i_end)%2!=0)
    {
        cout<<"Impossible"<<endl;
        return ;
    }
    vector<string> s;
    find(n,i_start,j_start,i_end,j_end,0,s);
    cout<<r<<" "<<endl;
    for(int i=0;i<v.size();i++)
    {
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

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