#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_s, int j_s, int i_e, int j_e) {
    //  Print the distance along with the sequence of moves.
    
    int flag=0;
    if(abs(i_s-i_e)%4==0 && abs(j_s-j_e)%2==0)  flag=1;
    else if(abs(i_s-i_e)%4!=0 && abs(i_s-i_e)%2==0 && abs(j_s-j_e)%2!=0)   flag=1;
    else cout<<"Impossible";

    int i=i_s, j=j_s;
    int count=0;
    vector<string> v_s;
    
   while(flag && (i!=i_e || j!=j_e))
    {
        if(i_e<i && j_e<=j) { i=i-2; j=j-1; v_s.push_back(string("UL"));}
        else if(i_e<i && j_e>j) { i=i-2; j=j+1; v_s.push_back(string("UR"));}
        else if(i_e>i && j_e>=j)    { i=i+2; j=j+1;v_s.push_back(string("LR"));}
        else if(i_e>i && j_e<j)     { i=i+2; j=j-1; v_s.push_back(string("LL"));}
        else if(j_e>j)  { j=j+2; v_s.push_back(string("R"));}
        else    { j=j-2; v_s.push_back(string("L"));}
        count++;
    }
    if(flag==1) cout<<count<<endl;
    for(int i=0;i<count; i++)
        cout<<v_s[i]<<" ";
}

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;
}