#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    if (n==1) {
        puts("0");
        return;
    }
    if ((i_start-i_end)&1) {
        puts("Impossible");
        return;
    }
    vector<string> ans;
    int x = abs(i_start-i_end)>>1, y = abs(j_start-j_end);
    if (x==0) {
        if (y&1) puts("Impossible");
        else {
            cout << (y>>1) << endl;
            for (int i=0;i*2<y;++i) {
                cout << (j_start<j_end?'R':'L');
                if (i*2==y-2) cout << endl;
                else cout << ' ';
            }
        }
        return;
    }
    for (int i=0;i<x;++i) {
        if (i_start<i_end) {
            if (j_start<=j_end && j_start+1<n) {
                ans.push_back("LR");
                ++j_start;
            } else {
                ans.push_back("LL");
                --j_start;
            }
            i_start += 2;
        } else {
            if (j_start<j_end || j_start==0) {
                ans.push_back("UR");
                ++j_start;
            } else {
                ans.push_back("UL");
                --j_start;
            }
            i_start -= 2;
        }
    }
    int cnt = 0;
    if ((j_start-j_end)&1) {
        puts("Impossible");
    } else {
        while (j_start != j_end) {
            if (j_start<j_end) {
                ans.push_back("R");
                j_start += 2;
                ++cnt;
            } else {
                ans.push_back("L");
                j_start -= 2;
            }
        }
        cout << ans.size() << endl;
        if (ans.size()==0) return;
        if (ans[0] != "UR" && ans[0] != "UL") {
            for (int i=0;i<cnt;++i) {
                cout << "R";
                if (i==ans.size()-1) cout << endl;
                else cout << ' ';
            }
        } else cnt = 0;
        for (int i=0;i<ans.size()-cnt;++i) {
            cout << ans[i];
            if (i==ans.size()-1) cout << endl;
            else cout << ' ';
        }
    }
}

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