#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n;
int vis[300][300]={0};
int lev[300][300]={0};
string g[300][300];
queue<int> q1,q2;
int mov[6][2]={{-1,-2},{1,-2},{2,0},{1,2},{-1,2},{-2,0}};
string m[6]={"UL","UR","R","LR","LL","L"};
void bfs(int i,int j)
{
    vis[i][j]=1;
    q1.push(i);q2.push(j);
    g[i][j]="";
    lev[i][j]=0;
    while(!q1.empty())
    {
        int ki=q1.front();
        q1.pop();
        int kj=q2.front();
        q2.pop();
        for(int i1=0;i1<6;i1++)
        {
            int vi=ki+mov[i1][0];
            int vj=kj+mov[i1][1];
            if(vi>=0&&vi<n&&vj>=0&&vj<n&&vis[vi][vj]==0)
            {
                vis[vi][vj]=1;
                  lev[vi][vj]=  lev[ki][kj]+1;
                q1.push(vi);
                q2.push(vj);
                string p="";
                p.append(g[ki][kj]);
             
                         p.append(m[i1]);   p.append(" ");
                g[vi][vj].append(p);
            }
        }
    }
    
}

int main() {
   cin>>n;
    int xi,xj,yi,yj;
    cin>>xj>>xi>>yj>>yi;
    bfs(xi,xj);
    if(vis[yi][yj]==0)
    {
        cout<<"Impossible\n";
    }
    else cout<<lev[yi][yj]<<endl<<g[yi][yj]<<endl;
    return 0;
}