#include <bits/stdc++.h>
                using namespace std;
                #define mod 1000000007
                #define rep(i,n) for(i=0;i<n;i++)
                #define pb push_back
                #define mp make_pair
                #define fi first
                #define sec second
                typedef long long int  ll;
                #define pii pair<ll,ll> 
                #define pic pair<int,char>
                #define vi vector< ll > 
                #define vvi vector< vi > 
                #define vpi vector< pii > 
                #define vvpi vector< vpi > 
                #define st  set <ll, greater <ll> >
                #define mst  multiset <ll, greater <ll> >
                #define in insert
                #define sz size
                #define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
                #define mapp  map <ll, ll>
                #define ppii pair< pii, pii > 
                #define que queue< ll > 
                #define deq queue< ll >
                #define mpit map <ll, ll> :: iterator
                #define mpins(x,y) insert(pair <ll, ll> (x, y))
                #define stk stack< ll >
                queue < pii > q;
                ll visited[200][200];
                ll movement[200][200];
                ll parent[200][200][2];
                ll level[200][200]; 
                vector < string > ans;
                int main()
                {
                    ll n;
                    cin>>n;
                    ll i1,j1,i2,j2;
                    cin>>i1>>j1>>i2>>j2;
                    memset(visited,0,sizeof(visited));
                    q.push(mp(i1,j1));
                    visited[i1][j1]=1;
                    parent[i1][j1][1]=-1;
                    parent[i1][j1][0]=-1;
                    level[i1][j1]=0;
                    movement[i1][j1]=-1;
                    while(!q.empty())
                    {
                        pii pp=q.front();
                        q.pop();
                        ll i=pp.fi;
                        ll j=pp.sec;
                                if((i-2)>-1 and (j-1)>-1 and visited[i-2][j-1]==0)
                        {
                            parent[i-2][j-1][0]=i;
                            parent[i-2][j-1][1]=j;
                            movement[i-2][j-1]=5;
                            level[i-2][j-1]=1+level[i][j];
                            visited[i-2][j-1]=1;
                            q.push(mp(i-2,j-1));
                            

                        }
                        if((i-2)>-1 and (j+1)<n and visited[i-2][j+1]==0)
                        {
                            parent[i-2][j+1][0]=i;
                            parent[i-2][j+1][1]=j;
                            movement[i-2][j+1]=0;
                            level[i-2][j+1]=1+level[i][j];
                            visited[i-2][j+1]=1;
                            q.push(mp(i-2,j+1));
                            

                        }
                        if((j+2)<n and visited[i][j+2]==0)
                        {
                            parent[i][j+2][0]=i;
                            parent[i][j+2][1]=j;
                            movement[i][j+2]=1;
                            level[i][j+2]=1+level[i][j];
                            visited[i][j+2]=1;
                            q.push(mp(i,j+2));
                        }
                        if((i+2)<n and (j+1)<n and visited[i+2][j+1]==0)
                        {
                            parent[i+2][j+1][0]=i;
                            parent[i+2][j+1][1]=j;
                            movement[i+2][j+1]=2;
                            level[i+2][j+1]=1+level[i][j];
                            visited[i+2][j+1]=1;
                            q.push(mp(i+2,j+1));
                        }
                        if((i+2)<n and (j-1)>-1 and visited[i+2][j-1]==0)
                        {
                            parent[i+2][j-1][0]=i;
                            parent[i+2][j-1][1]=j;
                            movement[i+2][j-1]=3;
                            level[i+2][j-1]=1+level[i][j];
                            visited[i+2][j-1]=1;
                            q.push(mp(i+2,j-1));
                        }
                        if((j-2)>-1 and visited[i][j-2]==0)
                        {
                            parent[i][j-2][0]=i;
                            parent[i][j-2][1]=j;
                            movement[i][j-2]=4;
                            level[i][j-2]=1+level[i][j];
                            visited[i][j-2]=1;
                            q.push(mp(i,j-2));
                        }
                         if((i-2)>-1 and (j-1)>-1 and visited[i-2][j-1]==0)
                        {
                            parent[i-2][j-1][0]=i;
                            parent[i-2][j-1][1]=j;
                            movement[i-2][j-1]=5;
                            level[i-2][j-1]=1+level[i][j];
                            visited[i-2][j-1]=1;
                            q.push(mp(i-2,j-1));
                            

                        }


                        


                    }
                    if(visited[i2][j2]==0)
                        cout<<"Impossible";
                    else
                    {
                        cout<<level[i2][j2]<<"\n";
                        while(parent[i2][j2][1]!=-1)
                        {
                            ll oo=movement[i2][j2];
                            
                            if(oo==0)
                                ans.pb("UR");
                            else if(oo==1)
                                ans.pb("R");
                            else if(oo==2)
                                ans.pb("LR");
                            else if(oo==3)
                                ans.pb("LL");
                            else if(oo==4)
                                ans.pb("L");
                            else 
                                ans.pb("UL");
                            ll x=parent[i2][j2][0];
                            ll y=parent[i2][j2][1];
                            i2=x;
                            j2=y;

                        }
                        ll i;
                        for(i=ans.size()-1;i>=0;i--)
                        {
                            cout<<ans[i]<<" ";
                        }
                    }


                }