#include <bits/stdc++.h>

using namespace std;

int INF = 1 << 30;
int dy[6] = {-2,-2,0,2,2,0};
int dx[6] = {-1,1,2,1,-1,-2};
vector< vector< vector<int> > > path(200,vector< vector<int> >(200));
vector< vector< int > >dist(200, vector< int >(200,INF) );
string getMove(int i){
    if(i == 0){
        return "UL";
    }else if(i == 1){
        return "UR";
    }else if(i == 2){
        return "R";
    }else if(i == 3){
        return "LR";
    }else if(i == 4){
        return "LL";
    }else{
        return "L";
    }
}
string printVector(vector<int>tempPath){
    string ret = "";
    for(int k=0;k<tempPath.size();k++){
        ret += getMove(tempPath[k]) + " ";
    }
    return ret;
}
int calculateShortestPath(int n, int i_start, int j_start, int iEnd, int jEnd){
    dist[i_start][j_start] = 0;
    queue<int>q;
    q.push((i_start*n)+j_start);
    while(!q.empty()){
        int curNode = q.front();q.pop();
        int iCur = curNode/n;
        int jCur = curNode%n;
        //cout<<iCur<<" "<<jCur<<" "<<dist[iCur][jCur]<<" "<<printVector(path[iCur][jCur])<<endl;
        for(int k=0;k<6;k++){
            int iAdj = iCur + dy[k];
            int jAdj = jCur + dx[k];

            if(iAdj >=0 && iAdj < n && jAdj >=0 && jAdj < n && dist[iAdj][jAdj] > dist[iCur][jCur] + 1){
                dist[iAdj][jAdj] = dist[iCur][jCur] + 1;
                path[iAdj][jAdj] = path[iCur][jCur];
                path[iAdj][jAdj].push_back(k);
                q.push((iAdj*n)+jAdj);
            }
            
        }
    }
    return dist[iEnd][jEnd];
}
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int minMoves = calculateShortestPath(n,i_start,j_start,i_end,j_end);
    if(minMoves == INF){
        cout<<"Impossible"<<endl;
    }else{
        cout<<minMoves<<endl;
        cout<<printVector(path[i_end][j_end])<<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;
}