#include <bits/stdc++.h>
#define MAX 201
using namespace std;
int a[MAX][MAX];
int b[MAX][MAX];
int yy[]={-1,1,2,1,-1,-2};
int xx[]={-2,-2,0,2,2,0};
string s[]={"UL","UR","R","LR","LL","L"};
struct grid
{
    int x,y,dist;
    grid(int a, int b, int w)
        : x(a), y(b), dist(w)
    {
    }
};

int path(int x,int y,int x_end,int y_end,int n)
{
    queue<grid> q;
    grid source(x,y,0);
    q.push(source);
    a[x][y]=1;
    while (!q.empty()) {
        grid p = q.front();
        q.pop();
        // Destination found;
        if (p.x==x_end && p.y==y_end)
            return p.dist;
        for(int i=0;i<6;i++)
        {
            if(p.x+xx[i]>=0 && p.x+xx[i]<n && p.y+yy[i]>=0 && p.y+yy[i]<n)
            {
                if(a[p.x+xx[i]][p.y+yy[i]]==0)
                {
                    q.push(grid(p.x+xx[i],p.y+yy[i],p.dist+1));
                    a[p.x+xx[i]][p.y+yy[i]]=1;
                    b[p.x+xx[i]][p.y+yy[i]]=i;
                }
            }
        }
        
    }
    return -1;
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            a[i][j]=0;
            b[i][j]=9;
        }
    }
    int ans=path(i_start,j_start,i_end,j_end,n);
    if(ans==-1)
        cout<<"Impossible";
    else
    {
        cout<<ans<<endl;
        /*for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                cout<<b[i][j]<<" ";
            }
            cout<<endl;
        }*/
        vector<string> v;
        int x=i_end;
        int y=j_end;
        //cout<<x<<" "<<y<<endl;
        while(x!=i_start || y!=j_start)
        {
            
            int temp=b[x][y];
            v.push_back(s[temp]);
            x-=xx[temp];
            y-=yy[temp];
        }
        x=v.size()-1;
        for(;x>=0;x--)
            cout<<v[x]<<" ";
    }
}

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;
}