#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.
    if(abs(i_start-i_end)%2!=0){
        cout<<"Impossible";return ;
    }
    if(i_start==i_end&& abs(j_start-j_end)%2!=0){
        cout<<"Impossible";return ;
    }
    if(j_start==j_end&&abs(i_start-i_end)%4!=0){
        cout<<"Impossible";return ;
    }
    if(j_start==j_end&&abs(i_start-i_end)%4==0){
        int ver =i_start-i_end;
        cout<<abs(ver)/2<<endl;
        if(ver>0){
            for(int i=0;i<ver/4;i++){
                cout<<"UL UR ";return;
            }
        }else{
            for(int i=0;i<abs(ver)/4;i++){
                cout<<"LR LL ";return;
            }
        }
    }
    if(i_start-i_end>=0){ 
        int up=0,side=0;
        up=i_start-i_end;
        side= j_end-j_start;
        if((abs(side)-up/2)%2!=0){
            cout<<"Impossible";return ;
        }
        cout<<(up/2 +(abs(side) -up/2 )/2)<<endl;
        if(side>0){
            for(int i=0;i<up/2;i++)
                cout<<"UR ";
            for(int i=0;i<(side-up/2)/2;i++)
                cout<<"R ";
            return ;
        }else{
            for(int i=0;i<up/2;i++)
                cout<<"UL ";
            for(int i=0;i<(abs(side)-up/2)/2;i++)
                cout<<"L ";
            return ;
        }
    }else{
        int down=0,side=0;
        down =i_end-i_start;
        side=j_end-j_start;
        if((abs(side)-down/2)%2!=0){
            cout<<"Impossible";return ;
        }
        cout<<(down/2 +(abs(side) -down/2 )/2)<<endl;
        if(side>0){
            for(int i=0;i<(side-down/2)/2;i++)
                cout<<"R ";
            for(int i=0;i<down/2;i++)
                cout<<"LR ";
            return ;
        }else{
            for(int i=0;i<down/2;i++)
                cout<<"UL ";
            for(int i=0;i<(abs(side)-down/2)/2;i++)
                cout<<"L ";
            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;
}