#include <bits/stdc++.h>
#include <vector>
#include <algorithm>

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.
    vector<string> v;
    if(abs(i_start-i_end)%2!=0){
        cout<<"Impossible"<<endl;
        return;
    }
    
    
    int x,y;
    x=i_start;
    y=j_start;
    while(x!=i_end || y!=j_end){
        if(y==j_end){
        if(abs(x-i_end)%4!=0){
        cout<<"Impossible"<<endl;
        return;
    }
    }
         if(x==i_end){
            
        if(abs(y-j_end)%2!=0){
        cout<<"Impossible"<<endl;
        return;
    }
    
           else if(j_end>y){
                v.push_back("R");
                y=y+2;
            }
            else{
                v.push_back("L");
                y=y-2;
            }
        }
        else if(i_end<x){
            if(j_end>y){
                v.push_back("UR");
                y=y+1;
            }
            else{
                v.push_back("UL");
                y=y-1;
            }
            x=x-2;
        }
        else{
            if(j_end>=y){
                v.push_back("LR");
                y=y+1;
            }
            else{
                v.push_back("LL");
                y=y-1;
            }
            x=x+2;
        }
    }
    cout<<v.size()<<endl;
    for(int i=0;i<v.size();i++){
        cout<<v[i]<<" ";
    }
}

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;
    //int *count;
    //*count=0;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}