#include <bits/stdc++.h>

using namespace std;
int flag=0;
vector<int> v;
/*
 UL=0
 UR=1
 R=2
 LR=3
 LL=4
 L=5
*/
int ans(int n, int i_start, int j_start, int i_end, int j_end) {
    //printf("%d %d %d\n",i_start,j_start);
    if(flag==1 || flag==2)
    {
        return flag;
    }
    if(abs(i_start-i_end)==1)
    {
        flag=2;
        return flag;
    }
    else if( ( i_start==i_end && (abs(j_start-j_end))%2==1 ) || ( j_start==j_end && (abs(i_start-i_end))%4!=0 ) )
    {
        flag=2;
        return flag;
    }
    else if(i_start==i_end && j_start==j_end)
    {
        flag=1;
        return flag;
    }
    else if(i_start==i_end)
    {
        if(j_start<j_end)
        {
            for(int i=j_start;i<j_end;i=i+2)
            {
                v.push_back(2);
            }
            flag=1;
            return flag;
        }
        else
        {
            for(int i=j_end;i<j_start;i=i+2)
            {
                v.push_back(5);
            }
            flag=1;
            return flag;
        }
    }
    else if(j_start==j_end)
    {
        if(i_start<i_end)
        {
            for(int i=i_start;i<i_end;i=i+4)
            {
                v.push_back(3);
                v.push_back(4);
            }
            flag=1;
            return flag;
        }
        else
        {
            for(int i=i_end;i<i_start;i=i+4)
            {
                v.push_back(0);
                v.push_back(1);
            }
            flag=1;
            return flag;
        }
    }
    else
    {
        if(i_start<i_end && j_start<j_end)
        {
            //printf("hii");
            if(abs(j_start-j_end)==1)
            {
                v.push_back(3);
                ans(n,i_start+2,j_start+1,i_end,j_end);
                if(flag!=0)
                {
                    return flag;
                }
            }
            else
            {
                v.push_back(2);
                ans(n,i_start,j_start+2,i_end,j_end);
                if(flag!=0)
                {
                    return flag;
                }
            }
        }
        else if(i_start<i_end && j_start>j_end)
        {
            v.push_back(4);
            ans(n,i_start+2,j_start-1,i_end,j_end);
            if(flag!=0)
            {
                return flag;
            }
        }
        else if(i_start>i_end && j_start<j_end)
        {
            v.push_back(1);
            ans(n,i_start-2,j_start+1,i_end,j_end);
            if(flag!=0)
            {
                return flag;
            }
        }
        else if(i_start>i_end && j_start>j_end)
        {
            v.push_back(0);
            ans(n,i_start-2,j_start-1,i_end,j_end);
            if(flag!=0)
            {
                return flag;
            }
        }
    }
    return flag;
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end,tmp;
    cin >> i_start >> j_start >> i_end >> j_end;
    tmp=ans(n, i_start, j_start, i_end, j_end);
    if(tmp==2)
    {
        printf("Impossible\n");
    }
    if(tmp==1)
    {
        cout<<v.size()<<endl;
        for(int i=0;i<v.size();i++)
        {
            if(v[i]==0)
            {
                printf("UL ");
            }
            else if(v[i]==1)
            {
                printf("UR ");
            }
            else if(v[i]==2)
            {
                printf("R ");
            }
            else if(v[i]==3)
            {
                printf("LR ");
            }
            else if(v[i]==4)
            {
                printf("LL ");
            }
            else if(v[i]==5)
            {
                printf("L ");
            }
        }
        printf("\n");
    }
    return 0;
}