#include <bits/stdc++.h>

using namespace std;

int findDistance(int i_s,int j_s,int i_e,int j_e){
    return abs(i_e - i_s) + abs(j_e - j_s);
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end,string pos) {
    //  Print the distance along with the sequence of moves.
    static int distance_to_goal = 0,current_step = 0,prev_distance_to_goal = 1000;
    static vector <string> path;
    static int flag = 0;
    distance_to_goal = findDistance(i_start,j_start,i_end,j_end);
    static int expected_steps = (distance_to_goal%3 == 0)?(distance_to_goal/3):(distance_to_goal/3 + 1);
    //cout<<"CS: ES: Is: Js: Ie: Je: DTG: PDTG:"<<endl;
    //cout<<current_step<<" "<<expected_steps<<" "<<i_start<<" "<<j_start<<" "<<i_end<<" "<<j_end<<" "<<distance_to_goal<<" "<<prev_distance_to_goal<<endl;
    if(i_start < 0 || j_start < 0 || i_start > n || j_start > n)
        return;
    if(distance_to_goal == 0){
        if(current_step == expected_steps - 1){
            path.push_back(pos);
            current_step++;
            cout<<current_step<<endl;
            for(std::vector<string>::iterator i=path.begin()+1;i<path.end();i++){
                cout<<*i<<" ";
            }
            exit(0);
        }
        else{
            prev_distance_to_goal = distance_to_goal;
            return;
        }
    }
    if(distance_to_goal != 1 && distance_to_goal < prev_distance_to_goal){
        if(flag != 0){
            path.push_back(pos);
            current_step++;
            prev_distance_to_goal = distance_to_goal;
        }
        else{
            path.push_back(pos);
            prev_distance_to_goal = distance_to_goal;
            flag = 1;
        }
    }
    else{       
        return;
    }
    printShortestPath(n,i_start-2,j_start-1,i_end,j_end,"UL");
    printShortestPath(n,i_start-2,j_start+1,i_end,j_end,"UR");
    printShortestPath(n,i_start,j_start+2,i_end,j_end,"R");
    printShortestPath(n,i_start+2,j_start+1,i_end,j_end,"LR");
    printShortestPath(n,i_start+2,j_start-1,i_end,j_end,"LL");
    printShortestPath(n,i_start,j_start-2,i_end,j_end,"L");
    path.erase(path.begin()+current_step);
    current_step--;
    if(path.size() == 0)
        cout<<"Impossible";
}
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;
}