#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end,string ss,vector<string> &s) {
    //  Print the distance along with the sequence of moves.
    if((i_end==i_start) && (j_start==j_end))
    {
  
    }
    else
    {
        if((i_end<i_start) && (j_end<=j_start))
        {
            printShortestPath(n,i_start-2,j_start-1,i_end,j_end,"UL",s);
        }
        else if((i_end<i_start) && (j_end>j_start))
        {
            printShortestPath(n,i_start-2,j_start+1,i_end,j_end,"UR",s);
        }
        else if((i_end==i_start) && (j_end>j_start))
        {
            printShortestPath(n,i_start,j_start+2,i_end,j_end,"R",s);
        }
        else if((i_end>i_start) && (j_end>=j_start))
        {
            //cout<<"LR ";
            printShortestPath(n,i_start+2,j_start+1,i_end,j_end,"LR",s);
        }
        else if((i_end>i_start) && (j_end<j_start))
        {
            //cout<<"LL ";
            printShortestPath(n,i_start+2,j_start-1,i_end,j_end,"LL",s);
        }
        else if((i_end==i_start) && (j_end<j_start))
        {
            //cout<<"L ";
            printShortestPath(n,i_start,j_start-2,i_end,j_end,"L",s);
        }
    }
    s.push_back(ss);
}

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;
    vector<string> s;
    if(abs(i_end-i_start)%2==0)
    {
        printShortestPath(n, i_start, j_start, i_end, j_end,"\0",s);
        cout<<s.size()-1<<endl;
        for(int i=s.size()-2;i>=0;i--)
        {
            cout<<s[i]<<" ";
        }
    }
    else
        cout<<"Impossible";
    return 0;
}