//submitted by HimJ
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define fi first
#define se second
#define fr(i,s,e) for(i=s;i<e;i++)
#define be begin
#define ms(arr,val) memset(arr,val,sizeof(arr))
using namespace std;
int nx[]={-2,-2,0,2,2,0},ny[]={-1,1,2,1,-1,-2},n,endx,endy,sx,sy;
bool vis[201][201]={0};
string arr[]={"UL","UR","R","LR","LL","L"};
bool check(int x,int y)
{
    if(x<0||y<0||x>=n||y>=n||vis[x][y])
        return false;
    return true;
}
pair<int,pair<int,int> > par[200][200];
void printPath(pair<int,pair<int,int> > p)
{
    if(!(p.fi==sx&&p.se.fi==sy))
    printPath(par[p.fi][p.se.fi]);
    cout<<arr[p.se.se]<<" ";
}
int bog(int x,int y)
{
    queue<pair<int,pair<int,int> > > q;
    q.push({x,{y,0}});
 
    pair<int,pair<int,int> > t;
    vis[x][y] = true;
    while (!q.empty())
    {
        t = q.front();
        q.pop();
        vis[t.fi][t.se.fi] = true;
 
        if (t.fi == endx && t.se.fi == endy)
        {
            
            cout<<t.se.se<<"\n";
            printPath(par[t.fi][t.se.fi]);
           // cout<<par[t.fi][t.se.fi].se.se;
            return 1;
        }
 
 
        //  loop for all reahable states
        for (int i = 0; i < 6; i++)
        {
            x = t.fi + nx[i];
            y = t.se.fi + ny[i];
 
            // If rechable state is not yet visited and
            // inside board, push that state into queue
            if (check(x, y))
            {
                vis[x][y]=1;
                q.push({x, {y, t.se.se + 1}});
                par[x][y]={t.fi,{t.se.fi,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.
    endx=i_end;
    endy=j_end;
    sx=i_start;
    sy=j_start;
    int ans=bog(i_start,j_start);
    if(ans==-1)
        cout<<"Impossible";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    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;
}