#include<bits/stdc++.h>
using namespace std;
#define piii pair<int,pair<int,int> >
#define pii pair<int,int>
#define ll long long
int v [205][205] ;
bool vis[205][205]; //Mark the node if visited
int m[6][2]={{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};
string ff[6]={ "UL", "UR", "R", "LR", "LL", "L"};
int n;
int level[205][205];
int check(int i,int j){
    if(i>=0 && j>=0 && i<n && j<n && vis[i][j]==0)
        return 1;
    return 0;
}
void back(int i,int j, int k, int l){
    int x=k;
    int y=l;
    stack<int> s;
    while(!(x==i && y==j)){
        s.push(v[x][y]);
        int tx=m[v[x][y]][0];
        int ty=m[v[x][y]][1];
        x=x-tx;
        y=y-ty;
    }
    while(!s.empty()){
        cout<<ff[s.top()]<<' ';
        s.pop();
    }
    cout<<'\n';
}
void bfs(int i,int j, int k, int l) {
    queue < pair <int,int> > q;
    q.push({i,j});
    vis[i][j] = true;
    v[i][j]=0;
    level[i][j]=0;
    while(!q.empty())
    {
        pair <int,int> p = q.front();
        int x=p.first;
        int y=p.second;
        q.pop();
        if(x==k && y==l){
            cout<<level[x][y]<<'\n';
            back(i,j,k,l);
            return ;
        }
        for(int i = 0;i<6 ; i++)
        {
            if(check(x+m[i][0],y+m[i][1]))
            {
                q.push({x+m[i][0],y+m[i][1]});
                v[x+m[i][0]][y+m[i][1]]=i;
                vis[x+m[i][0]][y+m[i][1]] = 1;
                level[x+m[i][0]][y+m[i][1]]=level[x][y]+1;
            }
        }
    }
    cout<<"Impossible"<<'\n';
}

int main(){
    int i,j,k,l;
    cin>>n;
    cin>>i>>j>>k>>l;
    memset(vis,0,sizeof(vis));
    bfs(i,j,k,l);
    return 0;
}