#include <bits/stdc++.h>

using namespace std;
vector<int> count1(6, 0);
string str[] = {"UL", "UR", "R", "LR", "LL", "L"};
int total = 0;
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    if(i_start == i_end && j_start == j_end) return;
    if(i_start == i_end) {
        if(j_start > j_end){
            count1[5]++;total++;
            printShortestPath(n, i_start, j_start - 2, i_end, j_end);
        } else {
            count1[2]++;total++;
            printShortestPath(n, i_start, j_start + 2, i_end, j_end);
        }
        return;
    }
    if(i_start > i_end){
        if(j_start > j_end){
            count1[0]++;total++;
            printShortestPath(n, i_start - 2, j_start - 1, i_end, j_end);
        } else {
            count1[1]++;total++;
            printShortestPath(n, i_start - 2, j_start + 1, i_end, j_end);
        }
        return;
    } else {
        if(j_start > j_end){
            count1[4]++;total++;
            printShortestPath(n, i_start + 2, j_start - 1, i_end, j_end);
        } else {
            count1[3]++;total++;
            printShortestPath(n, i_start + 2, j_start + 1, i_end, j_end);
        }
    }
}

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 diffi = abs(i_end - i_start);
    int diffj = abs(j_end - j_start);
    if(abs(i_end - i_start) % 2 == 1) {
        cout<<"Impossible"<<endl;
        return 0;
    }
    if((diffi / 2)%2 == 0 && diffj % 2 == 1) {
        cout<<"Impossible"<<endl;
        return 0;
    }
    if((diffi / 2)%2 == 1 && diffj % 2 == 0) {
        cout<<"Impossible"<<endl;
        return 0;
    }
    printShortestPath(n, i_start, j_start, i_end, j_end);
    
    cout<<total<<endl;
    for(int i = 0; i < 6; i++){
        if(count1[i] == 0) continue;
        for(int j = 0; j < count1[i]; j++){
            cout<<str[i]<<" ";
        }
    }
    cout<<endl;
    return 0;
}