#include <bits/stdc++.h>

using namespace std;
int pr(string s)
{
    if(s=="UL")return 1;
    if(s=="UR")return 2;
    if(s=="R")return 3;
    if(s=="LR")return 4;
    if(s=="LL")return 5;
    else return 6;
}
bool cmp(string a, string b)
{
    return pr(a)<pr(b);
}
void printmoves(int x1, int y1, int x2, int y2)
{
    vector<string> v;
    while(1)
    {
        if(x1==x2&&y1==y2)break;
        if(x1==x2)//move y1 only
        {
            if(y1<y2)
            {
                y1+=2;
                v.push_back("R");
            }
            else
            {
                y1-=2;
                v.push_back("L");
            }
        }
        else if(x1<x2&&y1<=y2)
        {
            x1+=2;
            y1+=1;
            v.push_back("LR");
        }
        else if(x1>x2&&y1<=y2)
        {
            x1-=2;
            y1+=1;
            v.push_back("UR");
        }
        else if(x1<x2&&y1>y2)
        {
            x1+=2;
            y1-=1;
            v.push_back("LL");
        }
        else if(x1>x2&&y1>y2)
        {
            x1-=2;
            y1-=1;
            v.push_back("UL");
        }
    }
    cout<<v.size()<<endl;
    sort(v.begin(), v.end(), cmp);
    for(int i=0;i<v.size();i++)cout<<v[i]<<" ";
}
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    int rwdiff=abs(i_start-i_end);
    int cldiff=abs(j_start-j_end);
    if(rwdiff%4==0)
    {
        if(cldiff&1)
        {
            cout<<"Impossible";
            return;
        }
        else printmoves(i_start, j_start, i_end, j_end);
    }
    else if(rwdiff%4==2)
    {
        if(!(cldiff&1))
        {
            cout<<"Impossible";
            return;
        }
        else printmoves(i_start, j_start, i_end, j_end);
    }
    else
    {
        cout<<"Impossible";
        return;
    }
}

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