#include <bits/stdc++.h>
#define inf 1e18

using namespace std;

struct data {
    vector<string> path;
};

int dx[6] = {-2,-2,0,2,2,0},dy[6] = {-1,1,2,1,-1,-2};



bool valid(int i,int j,int n) {
    return (i >= 0 && i<n && j >= 0 && j < n);
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    data ans[n+1][n+1];
    queue<pair<int,int> > q;
    q.push({i_start,j_start});
    while(!q.empty()) {
        pair<int,int> point = q.front();
        q.pop();
        int x = point.first,y = point.second;
        for(int i = 0;i < 6;i++) {
            int cx = x+dx[i] , cy = y+dy[i];
            if(valid(cx,cy,n)) {
                if(ans[cx][cy].path.size() == 0) {
                    //cout<<cx<<" "<<cy<<" "<<valid(cx,cy,n)<<endl;
                    for(int j = 0;j < ans[x][y].path.size(); j++)
                        ans[cx][cy].path.push_back(ans[x][y].path[j]);
                    if(i == 0)
                        ans[cx][cy].path.push_back("UL");
                    else if(i == 1)
                        ans[cx][cy].path.push_back("UR");
                    else if(i == 2)
                        ans[cx][cy].path.push_back("R");
                    else if(i == 3)
                        ans[cx][cy].path.push_back("LR");
                    else if(i == 4)
                        ans[cx][cy].path.push_back("LL");
                    else
                        ans[cx][cy].path.push_back("L");
                    q.push({cx,cy});
                }
            }
        }
    }
    if(ans[i_end][j_end].path.size() == 0){
        cout<<"Impossible"<<endl;
        return;
    }
    else {
        cout<<ans[i_end][j_end].path.size()<<endl;
        for(int i = 0; i < ans[i_end][j_end].path.size();i++)
            cout<<ans[i_end][j_end].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;
}