#include <bits/stdc++.h>
#include <queue>

using namespace std;
queue<int> qi,qj,qz,qd;
int visit[205][205];
int dist[205][205];
bool success;
int solution[4025];
int sol_count;


void init(int n){
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++){
            visit[i][j]=-1;
            dist[i][j]=0;
            
        }
    sol_count=0;
    while(!qi.empty())
        qi.pop();
    while(!qj.empty())
        qj.pop();
    while(!qz.empty())
        qz.pop();
    while(!qd.empty())
        qd.pop();
}

void setStep(int i_now, int j_now){
    if(visit[i_now][j_now]==0)return;
    
    solution[sol_count++] = visit[i_now][j_now];
    switch(visit[i_now][j_now]){
        case 1: //UL
            i_now = i_now + 2;
            j_now = j_now + 1;
        break;
        case 2: //UR
            i_now = i_now + 2;
            j_now = j_now - 1;
            break;
        case 3: //R
            j_now = j_now - 2;
            break;
        case 4://"LR";
            i_now = i_now - 2;
            j_now = j_now - 1;
            break;
        case 5://"LL";
            i_now = i_now - 2;
            j_now = j_now + 1;
            break;
        case 6://"L";
            j_now = j_now + 2;
            break;
    }
    setStep(i_now,j_now);
}

void printStep(int direction) {
    switch(direction){
        case 1: //UL
            cout << "UL";
        break;
        case 2: //UR
            cout << "UR";
            break;
        case 3: //R
            cout << "R";
            break;
        case 4://"LR";
            cout << "LR";
            break;
        case 5://"LL";
            cout << "LL";
            break;
        case 6://"L";
            cout << "L";
            break;
    }
}

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.
    init(n);
    int i_cur;
    int j_cur;
    int state_cur;
    int dist_cur=0;
    
    qi.push(i_start);
    qj.push(j_start);
    qz.push(0);
    qd.push(0);
    
    while(!qi.empty()){
        
        i_cur = qi.front();
        j_cur = qj.front();
        state_cur = qz.front();
        dist_cur = qd.front();
        qi.pop();
        qj.pop();
        qz.pop();
        qd.pop();
        
        if(visit[i_cur][j_cur]<0){
            visit[i_cur][j_cur] = state_cur;
            dist[i_cur][j_cur] = dist_cur;
            if(i_cur==i_end&&j_cur==j_end)
                setStep(i_cur,j_cur);
            //UL
            qi.push(i_cur-2);
            qj.push(j_cur-1);
            qz.push(1);
            qd.push(dist_cur+1);
            //UR
            qi.push(i_cur-2);
            qj.push(j_cur+1);
            qz.push(2);
            qd.push(dist_cur+1);
            //R
            qi.push(i_cur);
            qj.push(j_cur+2);
            qz.push(3);
            qd.push(dist_cur+1);
            //LR
            qi.push(i_cur+2);
            qj.push(j_cur+1);
            qz.push(4);
            qd.push(dist_cur+1);
            //LL
            qi.push(i_cur+2);
            qj.push(j_cur-1);
            qz.push(5);
            qd.push(dist_cur+1);
            //L
            qi.push(i_cur);
            qj.push(j_cur-2);
            qz.push(6);
            qd.push(dist_cur+1);
        }
    }
    if(sol_count==0)
        cout<<"Impossible";
    else
    {
        cout<<dist[i_end][j_end]<<endl;
        for(int i=sol_count-1;i>=0;i--)
        {
            printStep(solution[i]);
            if(i>0)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;
}