#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int si, int sj, int di, int dj) {
    //  Print the distance along with the sequence of moves.
    int flag=0, count=0;
    string s;
    while(flag==0)
    {
        if(si==di && sj==dj)
        {
            break;
        }
        if(abs(di-si)==1 && abs(dj-sj)==1)
        {
            flag = 1;
            break;
        }
        else if(di<si)//dest is up
        {
            if(dj<sj)//up left
            {
                si-=2;
                sj-=1;
               // cout<<"UL"<<" ";
                s= s+"UL ";
                count++;
            }
            else if(dj>sj)//up right
            {
                si-=2;
                sj+=1;
                //cout<<"UR"<<" ";
                s+="UR ";
                count++;
            }
            else//above
            {
                if((si-di)%4 !=0)
                {
                    flag = 1;
                    break;
                }
                else
                {
                    int x = (si-di)/4;
                    for(int i=0; i<x; i++)
                        s+="UL ";
                       // cout<<"UL"<<" ";
                    for(int i=0; i<x; i++)
                        s+="UR ";
                        //cout<<"UR"<<" ";
                    count=count+(2*x);
                    si = di;
                    sj = dj;
                }
            }
        }
        else if(di>si)//dest is down
        {
            if(dj>sj)//down right
            {
                si = si+2;
                sj = sj+1; 
                //cout<<"LR"<<" ";
                s+="LR ";
                count++;
            }
            else if(dj<sj)//down left
            {
                si+=2;
                sj-=1;
                //cout<<"LL"<<" ";
                s+="LL";
                count++;
            }
            else 
            {
                if((di-si)%4 != 0)
                {
                    flag = 1;
                    break;
                }
                else
                {
                    int x = (di-si)/4;
                    for(int i=0; i<x; i++)
                        s+="LR ";
                       // cout<<"LR"<<" ";
                    for(int i=0; i<x; i++)
                        s+="LL ";
                       // cout<<"LL"<<" ";
                    count=count+(2*x);
                    si = di;
                    sj = dj;
                }
            }
        }
        else if(si==di)//horizontally same
        {
            if(dj>sj)//right
            {
                if((dj-sj)%2 !=0)
                {
                    flag = 1;
                    break;
                }
                else
                {
                    int x = (dj-sj)/2;
                    for(int i=0; i<x; i++)
                        s+="R ";
                       // cout<<"R"<<" ";
                    count+=x;
                    si = di;
                    sj = dj;
                }
            }
            else if(dj<sj)//left
            {
                if((sj-dj)%2 !=0)
                {
                    flag = 1;
                    break;
                }
                else
                {
                    int x = (sj-dj)/2;
                    for(int i=0; i<x; i++)
                        s+="L ";
                       // cout<<"L"<<" ";
                    count+=x;
                    si = di;
                    sj = dj;
                }     
            }
        }
        if(si==di && sj==dj)
        {
            break;
        }
    }
    if(flag==1)
    {
        //system("clear");
        cout<<"Impossible";
    }
    else{
        cout<<count<<endl;
        cout<<s;
    }
}

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