#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;

bool mat[209][209];
int prv[209][209];
int n;
int i_s, i_e, j_s, j_e;

int i_d[6]={-2,-2,0,2,2,0};
int j_d[6]={-1,1,2,1,-1,-2};
string tr[6]={"UL", "UR", "R", "LR", "LL", "L"};

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    
    cin>>n;
    cin>>i_s>>j_s>>i_e>>j_e;
    
    mat[i_s][j_s]=true;
    prv[i_s][j_s]=-1;
    queue<int> q;
    
    q.push(i_s);
    q.push(j_s);
    
    while(!q.empty()){
        int i=q.front();
        q.pop();
        int j=q.front();
        q.pop();
        
        for(int k=0; k<6; k++){
            int n_i = i+i_d[k];
            int n_j = j+j_d[k];
            if(n_i>=0 && n_i<n && n_j>=0 && n_j<n && mat[n_i][n_j]==false){
                mat[n_i][n_j]=true;
                prv[n_i][n_j]=k;
                q.push(n_i);
                q.push(n_j);
            }
        }
    }
    
    if(mat[i_e][j_e]==false){
        cout<<"Impossible"<<endl;
    }else{
        stack<string> s;
        int cur_i=i_e;
        int cur_j=j_e;
        while(prv[cur_i][cur_j]!=-1){
            int k=prv[cur_i][cur_j];
            s.push(tr[k]);
            cur_i = cur_i - i_d[k];
            cur_j = cur_j - j_d[k];
        }
        cout<<s.size()<<endl;
        while(!s.empty()){
            cout<<s.top()<<" ";
            s.pop();
        }
        cout<<endl;
    }
    
    return 0;
}