#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
vector<string> ans;
int ct=0;
    while(i_start>i_end && j_start>j_end ){
        ct++;
        ans.push_back("UL");
        i_start-=2;
        j_start-=1;
    }
    
    while(i_start>i_end && j_start<j_end ){
        ct++;
        ans.push_back("UR");
        i_start-=2;
        j_start+=1;
    }
    
    while(i_start==i_end && j_start<j_end ){
        ct++;
        ans.push_back("R");
       // i_start-=2;
        j_start+=2;
    }
    while(i_start<i_end && j_start<j_end ){
        ct++;
        ans.push_back("LR");
        i_start+=2;
        j_start+=1;
    }
    while(i_start<i_end && j_start>j_end ){
        ct++;
        ans.push_back("LL");
        i_start+=2;
        j_start-=1;
    }
    while(i_start==i_end && j_start>j_end ){
        ct++;
        ans.push_back("L");
        //i_start-=2;
        j_start-=2;
    }
    cout<<ct<<"\n";
    for(int i=0;i<ans.size();i++)
        cout<<ans[i]<<" ";
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    
    if(abs(i_start-i_end)%2!=0){
        cout<<"Impossible";
        return 0;
    }
    
    if(i_start==i_end && abs(j_start-j_end)%2!=0){
        cout<<"Impossible";
        return 0;
    }
        
    if(j_start==j_end && abs(i_start-i_end)%4!=0){
        cout<<"Impossible";
        return 0;
    }
    
    if(j_start==j_end){
        
        int n = abs(i_start-i_end)/4;
        cout<<abs(i_start-i_end)/2<<"\n";
        while(n--){
            
            if(i_start<i_end)
            cout<<"LR LL ";
            
            else
                cout<<"UL UR";
        }
        return 0;
    }
    
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}