#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

struct pointer
{
    int x;
    int y;
};

struct queueNode
{
    pointer pt;
    int dist;
};

int rowNum[]={-2,-2,0,2,2,0};
int colNum[]={-1,1,2,1,-1,-2};

bool visitd[200][200];
string vals[]={"UL","UR","R","LR","LL","L"};
vector<string> fpath;

int move(int mat[200][200],pointer src,pointer dest,int n)
{
    
    memset(visitd,false,sizeof(visitd));
    visitd[src.x][src.y]=true;
    queue<queueNode> que;
    queueNode s={src,0};
    que.push(s);
    vector<vector<string> > path;
    path.push_back({"S"});
    while(!que.empty())
    {
        queueNode curr = que.front();
        pointer pt = curr.pt;
 
        // If we have reached the destination cell,
        // we are done
        if (pt.x == dest.x && pt.y == dest.y)
        {
            fpath=path.front();
            return curr.dist;
            
            
            //cout<<"^^^"<<fpath.size()<<endl;
            
        }
        que.pop();
        vector<string> temp=path.front();
        path.erase(path.begin());
        //cout<<"+=>"<<path.size()<<endl;
        for (int i = 0; i < 6; i++)
        {
            int row = pt.x + rowNum[i];
            int col = pt.y + colNum[i];
             
            // if adjacent cell is valid, has path and
            // not visited yet, enqueue it.
            if (row>=0 && row<n && col>=0 && col<n && 
               !visitd[row][col])
            {
                // mark cell as visited and enqueue it
                visitd[row][col] = true;
                queueNode Adjcell = { {row, col},
                                      curr.dist + 1 };
                que.push(Adjcell);
                vector<string> temp2=temp;
                temp2.push_back(vals[i]);
                path.push_back(temp2);
            }
        }
    }
    return INT_MAX;
}

int main() {
    
    int n,i,j,mat[200][200]={0};
    vector<int> str;
    int is,js,ie,je;
    cin>>n;
    cin>>is>>js;
    cin>>ie>>je;
    mat[is][js]=1;
    
    
    
    pointer src={is,js};
    pointer dest={ie,je};
    
    
    int dist=move(mat,src,dest,n);
    
 
    if(dist==INT_MAX)
        cout<<"Impossible";
    else
    {
        cout<<dist<<endl;
        for(i=1;i<fpath.size();i++)
            cout<<fpath[i]<<" ";
       
    }
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}