#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    int n;
    cin>>n;
    int xi,yi,xf,yf,mov[1000],no=0,r,s;
    cin>>xi>>yi>>xf>>yf;
    if((abs(xf-xi))%2==1)
    {
        cout<<"Impossible";
        return 0;
    }
    int k;
    k=(abs(xf-xi))/2;
       if(abs(yf-yi-k)%2==1)
       {
           cout<<"Impossible";
        return 0;
       }
       int m=(abs(xf-xi))/2;
     while(xf>xi)
       {
           xi=xi+2;
           if(yf>=yi){
             
               yi=yi+1;
               mov[no]=3;
               no++;
           }
           else{
               yi=yi-1;
               mov[no++]=4;
           }
       }
        while(xf<xi)
       {
           xi=xi-2;
           if(yf>=yi){
               yi=yi+1;
               mov[no]=1;
                 
               no++;
           }
           else{
               yi=yi-1;
               mov[no++]=0;
               
           }
       }
    while(yi<yf){
       yi=yi+2;
        mov[no++]=2;
    }
        while(yi>yf){
       yi=yi-2;
        mov[no++]=5;
    }
       cout<<no<<endl;
       for(int i=0;i<no;i++)
       {
           switch (mov[i]){
               case 0: cout<<"UL"<<" ";
                   break;
               case 1: cout<<"UR"<<" ";
                   break;
                    case 2: cout<<"R"<<" ";
                   break;
                    case 3: cout<<"LR"<<" ";
                   break;
                    case 4: cout<<"LL"<<" ";
                   break;
                    case 5: cout<<"L"<<" ";
                   break;
           }
       }
    return 0;
}