#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mincount=INT_MAX;
string path="";
vector <string> v;
bool isvalid(int a,int b,int n,int count)
{
    if(a>=0 && a<n && b>=0 && b<n && count<n-1)
        return 1;
    return 0;
}
void minpath(int s_l,int s_u,int e_l,int e_u,int count,string str,int n)
{
    if(str!="")
      v.push_back(str);
     if(s_l==e_l && s_u==e_u)
     {
         if(count<mincount)
         {
             mincount=count;
             path="";
             int size=v.size();
             for(int i=0;i<size;i++)
             {
                 path+=v[i]+" ";
             }
             
         }
         return;
     }
     if(isvalid(s_l-2,s_u-1,n,count))
     {
         
         minpath(s_l-2,s_u-1,e_l,e_u,count+1,"UL",n);
         v.pop_back();
     }
     if(isvalid(s_l-2,s_u+1,n,count))
     {
         minpath(s_l-2,s_u+1,e_l,e_u,count+1,"UR",n);
         v.pop_back();
     }
     if(isvalid(s_l,s_u+2,n,count))
     {
         minpath(s_l,s_u+2,e_l,e_u,count+1,"R",n);
         v.pop_back();
     }
     
     if(isvalid(s_l+2,s_u+1,n,count))
     {
         minpath(s_l+2,s_u+1,e_l,e_u,count+1,"LR",n);
         v.pop_back();
     }
     if(isvalid(s_l+2,s_u-1,n,count))
     {
         minpath(s_l+2,s_u-1,e_l,e_u,count+1,"LL",n);
         v.pop_back();
     }
     if(isvalid(s_l,s_u-2,n,count))
     {
         minpath(s_l,s_u-2,e_l,e_u,count+1,"L",n);
         v.pop_back();
     }
    
    str="";
    return;
    
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;cin>>n;
    int s_l,s_u;
    int e_l,e_u;
    cin>>s_l>>s_u>>e_l>>e_u;
    int count=0;
    minpath(s_l,s_u,e_l,e_u,count,"",n);
    if(mincount==INT_MAX)
      cout<<"Impossible"<<endl;
    else
    {
      cout<<mincount<<endl;
      cout<<path<<endl;
    }
    mincount=0;
    path="";
   
    
    
    return 0;
}