#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
int x[]={1,2,1,-1,-2,-1};
int y[]={-2,0,2,2,0,-2};
//string z[]={""}
int dist[203][203]={0};
int vis[203][203]={0};
pair<int,int> parent[203][203];
int n;
bool valid(int x,int y){
    if(x>=0 && x<n && y>=0 && y<n)return true;
    return false;
}
int main(){
    cin>>n;
    int ist,jst,ien,jen;
    cin>>ist>>jst>>ien>>jen;
    swap(ist,jst);
    swap(ien,jen);
    dist[ist][jst]=0;
    vis[ist][jst]=1;
    queue<pair<int,int> >Q;
    Q.push(mp(ist,jst));
    while(Q.size()>0){
        int a=Q.front().first;
        int b=Q.front().second;
        //cout<<a<<" "<<b<<" ab\n";
        Q.pop();
        if(a==ien && b==jen)break;
        {
            int i=5;
             int c=a+x[i];
            int d=b+y[i];
            if(valid(c,d) && vis[c][d]==0){
               // cout<<c<<" "<<d<<" adjacent nodes\n";
                vis[c][d]=1;
                dist[c][d]=1+dist[a][b];
                Q.push(mp(c,d));
                parent[c][d].first=a;
                parent[c][d].second=b;
            }
            
        }
        for(int i=0;i<5;++i){
            int c=a+x[i];
            int d=b+y[i];
            if(valid(c,d) && vis[c][d]==0){
               // cout<<c<<" "<<d<<" adjacent nodes\n";
                vis[c][d]=1;
                dist[c][d]=1+dist[a][b];
                Q.push(mp(c,d));
                parent[c][d].first=a;
                parent[c][d].second=b;
            }
        }
    }
    if(vis[ien][jen]==0){
        cout<<"Impossible\n";
    }else{
        cout<<dist[ien][jen]<<"\n";
        //printing path
        int st=ien,en=jen;
        vector<string>v;
        //cout<<ien<<" "<<jen<<" ien, jen before \n";
         //cout<<ist<<" "<<jst<<" ist, jst before \n";
        //cout<<st<<" "<<en<<" sten\n";
        //cout<<st<<" "
        while(st!=ist || en!=jst){
            //cout<<ist<<" "<<jst<<" ist,jst\n";
            string dir;
            int a=st,b=en;
            //cout<<a<<" "<<b<<" a,b path\n";
            
            int c=parent[a][b].first;
            int d=parent[a][b].second;
          //  cout<<c<<" "<<d<<" c,d parent\n";
            if(a-c==1 && b-d==-2){
                dir="UR";
            }else if(a-c==2 && b-d==0){
                dir="R";
            }else if(a-c==1 && b-d==2){
                dir="LR";
            }else if(a-c==-1 && b-d==2){
                dir="LL";
            }else if(a-c==-2 && b-d==0){
                dir="L";
            }else if(a-c==-1 && b-d==-2){
                dir="UL";
            }
            v.push_back(dir);
            st=c,en=d;
        }
        reverse(v.begin(),v.end());
        //cout<<parent[4][6].first<<" "<<parent[4][6].second<<" par4,6 \n";
        for(auto it:v)cout<<it<<" ";
        cout<<"\n";
    }
    
    
    return 0;
}