/***
Author: ShivamRathore (Shivam010)
Problem: Red Knight's Shortest Path
***/
#include <bits/stdc++.h>
//#include <unordered_map>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define Pi pair<int,int>
#define Pl pair<long long,long long>
#define vi vector<int>
#define vl vector<long long>
#define vb vector<bool>
#define vp vector<pair<int,int> >
#define vpl vector<pair<long long, long long> >
#define F first
#define S second
const ll mod=1000000007;

ll ab(ll c){
    if(c<0) return -c;
    return c;
}

ll pow(ll a,ll b){
    ll p=a%mod,ans=1;
    while(b){
        if(b&1) ans=(ans*p)%mod;
        p=(p*p)%mod;
        b>>=1;
    }
    return ans;
}

ll gcd(ll a,ll b){
    if(b==0) return a;
    return gcd(b,a%b);
}

int a[201][201];
int n,ix,iy,fx,fy;
int cnt=0;
int P[201][201];

void fun(int p,int q){
    cnt++;
    int v=a[p][q]+1;
    if(q+2<n){
    if(v<a[p][2+q] || (v==a[p][2+q] && P[p][2+q]>3)){
        a[p][q+2]=v;
        P[p][q+2]=3;
        fun(p,q+2);
    }
    }
    if(q-2>=0){
    if(v<a[p][q-2] || (v==a[p][q-2] && P[p][q-2]>6)){
        a[p][q-2]=v;
        P[p][q-2]=6;
        fun(p,q-2);
    }
    }
    if(p+2<n){
        if(q+1<n){
            if(v<a[p+2][q+1] || (v==a[p+2][q+1] && P[p+2][q+1]>4)){
                a[p+2][q+1]=v;
                P[p+2][q+1]=4;
                fun(p+2,q+1);
            }
        }
        if(q-1>=0){
            if(v<a[p+2][q-1] || (v==a[p+2][q-1] && P[p+2][q-1]>5)){
                a[p+2][q-1]=v;
                P[p+2][q-1]=5;
                fun(p+2,q-1);
            }
        }
    }
    if(p-2>=0){
        if(q+1<n){
            if(v<a[p-2][q+1] || (v==a[p-2][q+1] && P[p-2][q+1]>2)){
                a[p-2][q+1]=v;
                P[p-2][q+1]=2;
                fun(p-2,q+1);
            }
        }
        if(q-1>=0){
            if(v<a[p-2][q-1] || (v==a[p-2][q-1] && P[p-2][q-1]>1)){
                a[p-2][q-1]=v;
                P[p-2][q-1]=1;
                fun(p-2,q-1);
            }
        }
    }
}

int main()
{
    cin>>n;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            a[i][j]=INT_MAX;
            P[i][j]=7;
        }
    }
    cin>>ix>>iy>>fx>>fy;
    a[ix][iy]=0;
    P[ix][iy]=0;
    fun(ix,iy);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(a[i][j]==INT_MAX) a[i][j]=-1;
            //cout<<P[i][j]<<" ";
        }//cout<<endl;
    }
    if(a[fx][fy]!=-1){
        int v=a[fx][fy];
        cout<<v<<endl;
        int ans[v];
        int p=fx,q=fy,l;
        for(int i=0;i<v;i++){
            ans[i]=l=P[p][q];
            if(l==1){q++;p+=2;}
            else if(l==2){q--;p+=2;}
            else if(l==3){q-=2;}
            else if(l==4){q--;p-=2;}
            else if(l==5){q++;p-=2;}
            else if(l==6){q+=2;}
        }
        sort(ans,ans+v);
        for(int i=0;i<v;i++){
            if(ans[i]==1) cout<<"UL ";
            else if(ans[i]==2) cout<<"UR ";
            else if(ans[i]==3) cout<<"R ";
            else if(ans[i]==4) cout<<"LR ";
            else if(ans[i]==5) cout<<"LL ";
            else if(ans[i]==6) cout<<"L ";
        }
        cout<<endl;
    }
    else cout<<"Impossible";
    return 0;
}