#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <list>
//using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n,starti,startj,endi,endj;
    std::cin>>n>>starti>>startj>>endi>>endj;
    
    std::vector<std::string> fixed_moves{"UL","UR","R","LR","LL","L"};
    std::vector<int> moves_di{-2,-2,0,2,2,0},moves_dj{-1,1,2,1,-1,-2};
    
    std::vector<std::vector<int>> visited(n,std::vector<int>(n,-1));
    std::vector<std::vector<int>> track_moves(n,std::vector<int>(n,-1));
    visited[starti][startj]=100000000;
   
    
    std::queue<int> qi,qj;
    qi.push(starti);
    qj.push(startj);
    
    while(qj.size()){
        int curi=qi.front(),curj=qj.front();
        qi.pop();
        qj.pop();
        if(curi==endi && curj==endj){
            break;
        }
        
        for(int i=0;i<moves_di.size();++i){
            if(curi+moves_di[i]>=0 && curi+moves_di[i]<n && curj+moves_dj[i]>=0 && curj+moves_dj[i]<n && visited[curi+moves_di[i]][curj+moves_dj[i]]==-1){
                qi.push(curi+moves_di[i]);
                qj.push(curj+moves_dj[i]);
                visited[curi+moves_di[i]][curj+moves_dj[i]]=n*curi+curj;
                track_moves[curi+moves_di[i]][curj+moves_dj[i]]=i;
            }
        }
        
    }
    
    if(visited[endi][endj]==-1){
        std::cout<<"Impossible"<<std::endl;
       
    }else{
        std::list<int> moves;
    
        moves.push_front(track_moves[endi][endj]);
        int cur=n*endi+endj;
    
        while(visited[cur/n][cur%n]!=n*starti+startj){
            cur=visited[cur/n][cur%n];
            moves.push_front(track_moves[cur/n][cur%n]);
        }
    
        std::cout<<moves.size()<<std::endl;
    
        for(int i:moves){
            std::cout<<fixed_moves[i]<<" ";
        }
        std::cout<<std::endl;
    }
    
    
    return 0;
}