#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;

int f[205][205];
//int ans[205][205];
pair<int,int> par[205][205];
string s[210][210];
vector<string>v;
void bfs(int n,int sx,int sy,int dx,int dy){
    queue<pair<int,int> >q;
    q.push(mp(sx,sy));
    f[sx][sy]=1;
    //ans[sx][sy]=0;
    
    while(q.size()){
        
        if(f[dx][dy]==1){
            int tx=dx,ty=dy;
            //cout<<tx<<" "<<ty<<par[tx][ty].fi<<" "<<par[tx][ty].se<<endl;
            while(tx!=sx||ty!=sy){
               // cout<<tx<<" "<<ty<<endl;
                v.pb(s[tx][ty]);
                int tmpx=par[tx][ty].fi;
                int tmpy=par[tx][ty].se;
                tx=tmpx,ty=tmpy;
            }
            int sz=v.size();
            cout<<sz<<endl;
            for(int i=sz-1;i>=0;i--){
                cout<<v[i]<<" ";
            }
            break;
        }
        
        
        int x=q.front().fi;
        int y=q.front().se;
        //cout<<x<<" "<<y<<endl;
        q.pop();
        
        //cout<<x<<" "<<y<<" "<<par[x][y].fi<<" "<<par[x][y].se<<endl;
        
        
        if(x-2>=0&&y-1>=0&&f[x-2][y-1]==0){
            f[x-2][y-1]=1;
            par[x-2][y-1].fi=x;
            par[x-2][y-1].se=y;
            q.push(mp(x-2,y-1));
            //ans[x-2][y-1]=ans[x][y]+1;
            s[x-2][y-1]="UL";
        }
        if(x-2>=0&&y+1<n&&f[x-2][y+1]==0){
            f[x-2][y+1]=1;
            par[x-2][y+1].fi=x;
            par[x-2][y+1].se=y;
            q.push(mp(x-2,y+1));
            //ans[x-2][y+1]=ans[x][y]+1;
            s[x-2][y+1]="UR";
        }
        if(y+2<n&&f[x][y+2]==0){
            f[x][y+2]=1;
            par[x][y+2].fi=x;
            par[x][y+2].se=y;
            q.push(mp(x,y+2));
            //ans[x][y+2]=ans[x][y]+1;
            s[x][y+2]="R";
        }
        
        if(x+2<n&&y+1<n&&f[x+2][y+1]==0){
            f[x+2][y+1]=1;
            par[x+2][y+1].fi=x;
            par[x+2][y+1].se=y;
            q.push(mp(x+2,y+1));
            //ans[x+2][y+1]=ans[x][y]+1;
            s[x+2][y+1]="LR";
            
        }
        if(x+2<n&&y-1>=0&&f[x+2][y-1]==0){
            f[x+2][y-1]=1;
            par[x+2][y-1].fi=x;
            par[x+2][y-1].se=y;
            q.push(mp(x+2,y-1));
            //ans[x+2][y-1]=ans[x][y]+1;
            s[x+2][y-1]="LL";
        } 
         if(y-2>=0&&f[x][y-2]==0){
            f[x][y-2]=1;
            par[x][y-2].fi=x;
            par[x][y-2].se=y;
                q.push(mp(x,y-2));
            // ans[x][y-2]=ans[x][y]+1;
             s[x][y-2]="L";
        }
        //cout<<x<<" "<<y<<" "<<par[x][y].fi<<" "<<par[x][y].se<<endl;
        
    }
    if(f[dx][dy]==0){
        cout<<"Impossible"<<endl;
    }
    
}


int main() {
    int n;
    cin >> n;
    v.clear();
    for(int i=0;i<=204;i++){
        for(int j=0;j<=204;j++){
            //ans[i][j]=0;
            f[i][j]=0;
            par[i][j].fi=-1;
            par[i][j].se=-1;
        }
    }
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    bfs(n, i_start, j_start, i_end, j_end);
    cout<<endl;
   /* for(int i=0;i<7;i++){
        for(int j=0;j<7;j++){
            cout<<par[i][j].fi<<" "<<par[i][j].se<<" ";
        }
        cout<<endl;
    }*/
    
    return 0;
}