#include <bits/stdc++.h>

using namespace std;
string ok(int x){
    if(x==0) return "UL";
    else if(x==1) return "UR";
    else if(x==2) return "R";
    else if(x==3) return "LR";
    else if(x==4) return "LL";
    else return "L";
}
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    if(abs(i_start-i_end)%2){
        cout<<"Impossible"<<endl;
        return;
    }
    vector<int> v;
    int h = i_end-i_start;
    int w = j_end-j_start;
    while(abs(w)>abs(h)/2){
        if(w>0){ v.push_back(2); w-=2; }
        else   { v.push_back(5); w+=2; }
    }
    while(abs(w)){
        if(w>0){
            if(h>0){ v.push_back(3); w--; h-=2; }
            else   { v.push_back(1); w--; h+=2; }
        }
        else{
            if(h>0){ v.push_back(4); w++; h-=2; }
            else   { v.push_back(0); w++; h+=2; }
        }
    }
    if((abs(h)/2)%2){
        cout<<"Impossible"<<endl;
        return;
    }
    while(abs(h)){
        if(h>0){ v.push_back(3); h-=2; v.push_back(4); h-=2; }
        else   { v.push_back(1); h+=2; v.push_back(0); h+=2; }
    }
    cout<<v.size()<<endl;
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i++){
        cout<<ok(v[i])<<' ';
    }
    cout<<endl;
}

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