#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for(ll i = (x); i <= (y); ++i)
#define bug(a) cout << #a << " = " << a << endl;
#define fbug(a, x, y) { cout << #a << ": "; rep(i, x, y) cout << a[i] << ' '; cout << endl; }
#define pb push_back
//#define mp make_pair
#define endd "\n"
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define input freopen("inp.txt","r",stdin)
#define output freopen("out1.txt","w",stdout)
#define loop(i,n) for(ll i=0;i<n;i++)
#define rloop(i,n) for(ll i=n-1;i>=0;i--)
#define ll long long
#define Z size()
#define pii pair<int,int>
#define setp(x) fixed<<setprecision(x)
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pi 3.14159265358979323846264338327950288419716939937510
#define mset(x) memset(x,0,sizeof x);
#define spa cout<<endd
#define com(x)#x
#define mp make_pair
//#define modexp
#define inf 2000
#ifdef modexp
ll power(ll a , ll b,ll modi)
{
    ll res = 1 ;
    while(b)
    {
        if(b%2) {
            res = (res * a) % modi ;
        }
        b/=2 ;
        a = (a*a) % modi ;
    }
    return res ;
}
#endif
int dirx[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
int diry[] = { -1, 0, 1, -1, 1, -1, 0, 1 };
//*******************************TEMPLATE ENDS HERE *******************//

int n;
bool vis[300][300];
int is,js,ie,je;
bool isval(int x,int y){
    return (x>=0 && x<n && y>=0 && y<n && !vis[x][y]);
}
int main(){
   // input;
    cin>>n>>is>>js>>ie>>je;
    map<int,map<int,int> >save;
    queue<pii>q;
    
    q.push(mp(is,js));
    save[is][js]=n*is+js;
    bool ck=0;
    vis[is][js]=true;
    int steps=0;
    while(!q.empty()){
        pii tp=q.front();
        


        q.pop();

        int x,y;
        
        
        x=tp.ff-2;
        y=tp.ss-1;
        if(isval(x,y)){
            q.push(mp(x,y));
            save[x][y]=n*tp.ff+tp.ss;
            vis[x][y]=true;
            if(x==ie && y==je){
            ck=1;
            break;}
        }


        x=tp.ff-2;
        y=tp.ss+1;
        if(isval(x,y)){
            q.push(mp(x,y));
            save[x][y]=n*tp.ff+tp.ss;
            vis[x][y]=true;
            if(x==ie && y==je){
            ck=1;
            break;}
        }

        x=tp.ff;
        y=tp.ss+2;
        if(isval(x,y)){
            q.push(mp(x,y));
            save[x][y]=n*tp.ff+tp.ss;
            vis[x][y]=true;
            if(x==ie && y==je){
            ck=1;
            break;}
        }

        x=tp.ff+2;
        y=tp.ss+1;
        if(isval(x,y)){
            q.push(mp(x,y));
            save[x][y]=n*tp.ff+tp.ss;
            vis[x][y]=true;
            if(x==ie && y==je){
            ck=1;
            break;}
        }

        x=tp.ff+2;
        y=tp.ss-1;
        if(isval(x,y)){
            q.push(mp(x,y));
            save[x][y]=n*tp.ff+tp.ss;
            vis[x][y]=true;
            if(x==ie && y==je){
            ck=1;
            break;}
        }

        x=tp.ff;
        y=tp.ss-2;
        if(isval(x,y)){
            q.push(mp(x,y));
            save[x][y]=n*tp.ff+tp.ss;
            vis[x][y]=true;
            if(x==ie && y==je){
            ck=1;
            break;}
        }




    }
    if(ck){
    string ans="";
    int x=ie,y=je;
    //bug(save[x][y]);
    while(x!=is || y!=js){
        steps++;
        int a,b;
        int sum=save[x][y];
        a=sum/n;
        b=sum%n;
        //bug(sum);
        //bug(a);
        //bug(b);
        if(a==x-2 && b==y-1){
            ans+=" RL";
        }
        if(a==x-2 && b==y+1){
            ans+=" LL";
        }
        if(a==x && b==y+2){
            ans+=" L";
        }
        if(a==x+2 && b==y+1){
            ans+=" LU";
        }
        if(a==x+2 && b==y-1){
            ans+=" RU";
        }
        if(a==x && b==y-2){
            ans+=" R";
        }
       // cout<<ans;
        x=a;
        y=b;
    }  
    reverse(all(ans));
    cout<<steps;spa;
    cout<<ans; 
    }
    else{
        cout<<"Impossible\n";
    }


}