#include <bits/stdc++.h>

using namespace std;

void pass(int t)
{
    if(t==1) cout<<"R ";
    else if(t==2) cout<<"L ";
    else if(t==3) cout<<"UR ";
      else if(t==4) cout<<"LR ";  
         else if(t==5) cout<<"UL ";
        else if(t==6) cout<<"LL ";
}

void printShortestPath(int n, int is, int js, int ie, int je) {
    //  Print the distance along with the sequence of moves.
    int dis[n][n],pi[n][n];  //keeps min distance of every vertex(x,y) from (is,js)
    int i,j;
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
        {
            dis[i][j]=-1;
            pi[i][j]=0;
        }
                
    dis[is][js]=0;
    pi[is][js]=-1;
    
    queue <pair<int,int>> q;
    q.push(make_pair(js,is));
    
    while(!q.empty())
    {
        pair<int,int> p=q.front();
        q.pop();
        int x=p.first;
        int y=p.second;
        //cout<<"pop "<<x<<","<<y<<"-"<<dis[y][x]<<endl;
        
        if(x+2>=0 && x+2<n && y>=0 && y<n && dis[y][x+2]==-1) //R
        {
            dis[y][x+2]=dis[y][x]+1;
            pi[y][x+2]=1;
            q.push(make_pair(x+2,y));
        }
        if(x-2>=0 && x-2<n && y>=0 && y<n && dis[y][x-2]==-1)   //L
        {
            dis[y][x-2]=dis[y][x]+1;
           pi[y][x-2]=2;
            q.push(make_pair(x-2,y));
        }
        if(x+1>=0 && x+1<n && y+2>=0 && y+2<n && dis[y+2][x+1]==-1) //UR
        {
            dis[y+2][x+1]=dis[y][x]+1;
            pi[y+2][x+1]=3;
            q.push(make_pair(x+1,y+2));
        }
        if(x+1>=0 && x+1<n && y-2>=0 && y-2<n && dis[y-2][x+1]==-1) //LR
        {
            dis[y-2][x+1]=dis[y][x]+1;
           pi[y-2][x+1]=4;
            q.push(make_pair(x+1,y-2));
        }
        if(x-1>=0 && x-1<n && y+2>=0 && y+2<n && dis[y+2][x-1]==-1) //UL
        {
            dis[y+2][x-1]=dis[y][x]+1;
           pi[y+2][x-1]=5;
            q.push(make_pair(x-1,y+2));
        }
        if(x-1>=0 && x-1<n && y-2>=0 && y-2<n && dis[y-2][x-1]==-1) //LL
        {
            dis[y-2][x-1]=dis[y][x]+1;
           pi[y-2][x-1]=6;
            q.push(make_pair(x-1,y-2));
        }
    }
    int ans=dis[ie][je];
    if(ans== -1)
    cout<<"Impossible"<<endl;
    else
    {
        cout<<ans<<endl;
        int t,x=je,y=ie;
        while(x!=js || y!=is)
        {
            t=pi[x][y];
            pass(t);
            
            if(t==1){
                x=x-2;
            }
            else if(t==2)
                x=x+2;
            else if(t==3)
            {
                x=x-1;
                y=y-2;
            }
            else if(t==4)
            {
                x=x-1;
                y=y+2;
            }
            else if(t==5)
            {
                x=x+1;
                y=y-2;
            }
            else if(t==6)
            {
                x=x+1;
                y=y+2;
            }
        }
        
    }
}


int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}