#include <bits/stdc++.h>
#define name "b"
using namespace std;
int n,xx,yy,tt,ss;
const int maxn=210;
const string res[6]={"UL","UR","R","LR","LL","L"};
const int dx[6]={-2,-2,0,2,2,0};
const int dy[6]={-1,1,2,1,-1,-2};
struct o{
    int x,y;
};
string  s[maxn*maxn],trace[maxn][maxn];
int a[maxn][maxn],tracex[maxn][maxn],tracey[maxn][maxn];
queue <o>q;
int top;
bool sosanh(string a,string b){
    return(a<b);
}
void nhap(){
    cin>>n;
    cin>>xx>>yy>>ss>>tt;
    xx++;
    yy++;
    ss++;
    tt++;
}
void push(int u,int v){
    o c;
    c.x=u;
    c.y=v;
    q.push(c);
}
void xuli(){
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            a[i][j]=1;
        }
    }
    push(xx,yy);
    while (q.size()>0 && a[ss][tt]==1){
        o uu=q.front();
        q.pop();
        int u=uu.x;
        int v=uu.y;
//        cout<<u<<" "<<v<<" "<<endl;
        for (int k=0;k<6;k++){
            int s=u+dx[k];
            int t=v+dy[k];
//            cout<<s<<" "<<t<<" "<<a[s][t]<<endl;
            if (a[s][t]!=0){
                tracex[s][t]=u;
                tracey[s][t]=v;
                trace[s][t]=res[k];
                a[s][t]=0;
                push(s,t);
            }
        }
    }
//    return;
    if (a[ss][tt]==1){
        cout<<"Impossible";
    }
    else {
        top=0;
        while (!(ss==xx && tt==yy)){
            top++;
            s[top]=trace[ss][tt];
            int uu=tracex[ss][tt];
            int vv=tracey[ss][tt];
            ss=uu;
            tt=vv;
        }
        cout<<top<<"\n";
        for (int i=top;i>=1;i--){
            cout<<s[i]<<" ";
        }
    }
}
int main(){
    //freopen(name".inp","r",stdin);
    //freopen(name".out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    nhap();
    xuli();
}