#include <bits/stdc++.h>

using namespace std;

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 move[6][2]={{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};
    int dist;
    vector< int > track;
    do
    {
        int d[6];
        for(int i=0;i<6;i++)
        {
            int tempx=i_start+move[i][0];
            int tempy=j_start+move[i][1];
            if(tempx>=0 && tempx<n && tempy>=0 && tempy<n)
                d[i]=abs(i_end-tempx)+abs(j_end-tempy);
            else
                d[i]=n*n;
        }
        int min=0;
        for(int i=1;i<6;i++)   
        {
            if(d[min]>d[i])
            {
                min=i;
            }
        }
        i_start=i_start+move[min][0];
        j_start=j_start+move[min][1];
        track.push_back(min);
        dist=d[min];
    }while(dist!=1 && dist!=0);
    if(dist==0)
    {
        cout<<track.size()<<"\n";
        for(int i=0;i<track.size();i++)
        {
            switch(track[i])
            {
                case 0:cout<<"UL ";
                    break;
                case 1:cout<<"UR ";
                    break;
                case 2:cout<<"R ";
                    break;
                case 3:cout<<"LR ";
                    break;
                case 4:cout<<"LL ";
                    break;
                case 5:cout<<"L ";
            }
        }
    }
    else
        cout<<"Impossible";
}

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