#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int sx,sy,dx,dy;
    cin>>sy>>sx>>dy>>dx;
    queue<pair<int,int>>bfs;
    unordered_map<int,unordered_map<int,pair<string,long long>>>dp;
    bfs.push(make_pair(sx,sy));
    dp[sx][sy]=make_pair("",0);
    unordered_map<int,unordered_map<int,bool>>visited;
    while(!bfs.empty()){
        int s1x=bfs.front().first;
        int s1y=bfs.front().second;
        bfs.pop();
        if((s1x<0)||(s1x>=n)||(s1y<0)||(s1y>=n))continue;
        if(s1x==dx&&s1y==dy){
            cout<<dp[s1x][s1y].second<<'\n'<<dp[s1x][s1y].first;
            return 0;}
        if(!visited[s1x-1][s1y-2]){
        dp[s1x-1][s1y-2]=make_pair(dp[s1x][s1y].first+"UL ",dp[s1x][s1y].second+1);
        bfs.push(make_pair(s1x-1,s1y-2));
        visited[s1x-1][s1y-2]=1;}
        if(!visited[s1x+1][s1y-2]){
        dp[s1x+1][s1y-2]=make_pair(dp[s1x][s1y].first+"UR ",dp[s1x][s1y].second+1);
        bfs.push(make_pair(s1x+1,s1y-2));  visited[s1x+1][s1y-2]=1;}
        if(!visited[s1x+2][s1y]){
        dp[s1x+2][s1y]=make_pair(dp[s1x][s1y].first+"R ",dp[s1x][s1y].second+1);
        bfs.push(make_pair(s1x+2,s1y));
         visited[s1x+2][s1y]=1;}
        if(!visited[s1x+1][s1y+2]){
        dp[s1x+1][s1y+2]=make_pair(dp[s1x][s1y].first+"LR ",dp[s1x][s1y].second+1);
        bfs.push(make_pair(s1x+1,s1y+2));  visited[s1x+1][s1y+2]=1;}
        if(!visited[s1x-1][s1y+2]){
        dp[s1x-1][s1y+2]=make_pair(dp[s1x][s1y].first+"LL ",dp[s1x][s1y].second+1);
        bfs.push(make_pair(s1x-1,s1y+2));  visited[s1x-1][s1y+2]=1;}
        if(!visited[s1x-2][s1y]){
        dp[s1x-2][s1y]=make_pair(dp[s1x][s1y].first+"L ",dp[s1x][s1y].second+1);
        bfs.push(make_pair(s1x-2,s1y));  visited[s1x-2][s1y]=1;}
}
    cout<<"Impossible";
    return 0;}