#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int xx[6]={-2,0,2,2,0,-2};
int yy[6]={1,2,1,-1,-2,-1};
int check(int x, int y, int n){
    if((x>=0 && x<n) && (y>=0 && y<n))return 1;
    else return 0;
}
int visited[200][200]={0};
int m=10000;
string ns;
int shortestPath(int x, int y, int dx, int dy, int n, string s,int dis){
    if(x==dx && y==dy){
        if(dis<m){
            m=dis;
            ns=s;
        }
        return 1;
    }
    //cout<<x<<" " <<y<<" " <<s<<endl;
    visited[x][y]=1;
    if(check(x,y,n)){
        if(!visited[x+xx[0]][y+yy[0]]&&check(x+xx[0],y+yy[0],n))
            shortestPath(x+xx[0], y+yy[0], dx, dy, n, s+"UR ",dis+1);
       
        if(!visited[x+xx[1]][y+yy[1]]&&check(x+xx[1],y+yy[1],n))
            shortestPath(x+xx[1], y+yy[1], dx, dy, n, s+"R ",dis+1);
        
        if(!visited[x+xx[2]][y+yy[2]]&&check(x+xx[2],y+yy[2],n))
            shortestPath(x+xx[2], y+yy[2], dx, dy, n, s+"LR ",dis+1);
        
        if(!visited[x+xx[3]][y+yy[3]]&&check(x+xx[3],y+yy[3],n))
            shortestPath(x+xx[3], y+yy[3], dx, dy, n, s+"LL ",dis+1);
        
        if(!visited[x+xx[4]][y+yy[4]]&&check(x+xx[4],y+yy[4],n))
            shortestPath(x+xx[4], y+yy[4], dx, dy, n, s+"L ",dis+1);
        
        if(!visited[x+xx[5]][y+yy[5]]&&check(x+xx[5],y+yy[5],n))
            shortestPath(x+xx[5], y+yy[5], dx, dy, n, s+"UL ",dis+1);
    }
    visited[x][y]=0;
    return 0;
}

int main() {
    int n;
    cin>>n;
    int sx,sy,dx,dy;
    cin>>sx>>sy>>dx>>dy;
    string s="";
    shortestPath(sx, sy, dx, dy, n, s,0);
    if(m==10000)cout<<"Impossible"<<endl;
    else cout<<m<<endl<<ns<<endl;
    return 0;
}