#include <bits/stdc++.h>

using namespace std;

bool prio(string s1, string s2){
    map<string,int> priority = {{"UL", 0}, {"UR", 1}, {"R", 2}, {"LR", 3}, {"LL", 4}, {"L", 5}};
    return priority[s1] < priority[s2];
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    string lr[4] = {"LR", "UR", "UL", "LL"};
    string r[4] = {"R", "R", "L", "L"};
    string ll[4] = {"LL", "UL", "UR", "LR"};
    int ori;
    if(i_start<=i_end){
        if(j_start<=j_end)
            ori = 0;
        else
            ori = 3;
    }
    else{
        if(j_start<=j_end)
            ori = 1;
        else
            ori = 2;
    }

    if((i_end-i_start)%2!=0){
        cout<<"Impossible"<<endl;
        return;
    }
    if(((i_end-i_start)/2 + j_end-j_start)%2!=0){
        cout<<"Impossible"<<endl;
        return;
    }
    int path_length = abs(i_end-i_start)/2 + max(0, (abs(j_end-j_start) - abs(i_end-i_start)/2)/2);
    cout<<path_length<<endl;
    vector<string> path;
    for(int i=0; i<min(abs(i_end-i_start)/2,abs(j_end-j_start)); i++){
        path.push_back(lr[ori]);
    }
    for(int i=0; i<max(0,(abs(i_end-i_start)/2 - abs(j_end-j_start))/2); i++){
        path.push_back(ll[ori]);
        path.push_back(lr[ori]);
    }
    for(int i=0; i<max(0,(abs(j_end-j_start)-abs(i_end-i_start)/2)/2); i++){
        path.push_back(r[ori]);
    }
    sort(path.begin(), path.end(), prio);
    for(int i=0; i<path.size(); i++)
        cout<<path[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;
}