#include <bits/stdc++.h>

using namespace std;

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

string MM[]={"UL", "UR", "R", "LR", "LL", "L"};

void calc(vector<vector<int>>& cc, int start[2], int end[2], vector<int>& moves, int cnt, vector<int>& bestmoves)
{
    //cout << start[0] << " " << start[1]<<endl;
    if(cnt>bestmoves.size() && bestmoves.size()>0)
        return;
    
    if(cc[start[0]][start[1]] < cnt)
    {
       // cout << "cnt " << cc[start[0]][start[1]] << " " << cnt<<endl;

        return;
    }
    cc[start[0]][start[1]] = cnt;
    
    if(start[0]==end[0] && start[1]==end[1]){
//cout << cnt<<endl;

        if(cnt < bestmoves.size() || bestmoves.size()==0){
            bestmoves = vector<int>();
            for(int i=0;i<cnt;++i)
                bestmoves.push_back(moves[i]);
        }
        return;
    }
        
    for(int i=0;i<6;++i){
        int x = start[0]+M[i][0];
        int y = start[1]+M[i][1];
        
        if(x<0 || y<0 || x>=cc.size() || y>=cc.size())
            continue;
        
       
        //cc[x][y] = true;
        moves[cnt]=i;
        int p[]={x,y};
        calc(cc, p, end, moves, cnt+1, bestmoves);
        
       // cc[x][y] = false;


    }
    
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    vector<vector<int>> cc(n, vector<int>(n, INT_MAX));
    vector<int> moves(n*n);
    vector<int> bestmoves;
    cc[i_start][j_start]=1;
    int start[] = {i_start, j_start};
    int end[] = {i_end, j_end};

    calc(cc, start, end, moves, 0, bestmoves);
    
    if(bestmoves.size()==0)
        cout << "Impossible";
    else{
        cout << bestmoves.size()<<endl;
        for(auto c : bestmoves){
            cout << MM[c] << " ";
        }
    }
    
}

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, j_start, i_start, j_end, i_end);

    return 0;
}