#include <bits/stdc++.h>

using namespace std;


string d [] = {"UL", "UR", "R","LR","LL","L"};
int di[] = {-2,-2,0,2, 2, 0};
int dj[] = {-1, 1,2,1,-1,-2};
bool vis[205][205];

string get_d(int i_start, int j_start, int i_end, int j_end){
    //cout<<i_start<<" "<<j_start<<" " << i_end<<" " << j_end<<endl;
    for(int i=0;i<6;i++){
        int nxt_i = i_start + di[i];
        int nxt_j = j_start + dj[i];
        if(nxt_i == i_end && nxt_j == j_end){
            return d[i];
        }
    }
    return "bug!";
}

int cnt = 0;
void print_path(int i, const vector<pair<int, pair<int,int> > > &  q){
    if(q[i].first == -1){
        cout<<cnt<<endl;
        return;
    }
    cnt++;
    print_path(q[i].first,q);
    cout<<get_d(q[q[i].first].second.first, q[q[i].first].second.second, q[i].second.first, q[i].second.second)<<" ";
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    memset(vis,0,sizeof vis);
    vector<pair<int, pair<int,int> > > q;
    q.push_back(make_pair(-1 , make_pair(i_start, j_start) ) );
    vis[i_start][i_end] = 1;
    for(int i=0;i<q.size();i++){
        int prev = q[i].first;
        int cur_i = q[i].second.first;
        int cur_j = q[i].second.second;
      //  cerr<<prev <<" ->> " << cur_i<<" "<<cur_j<<endl;
        if(cur_i == i_end && cur_j == j_end){
            print_path(i,q);
            return;
        }
        
        for(int k=0;k<6;k++){
            int nxt_i = cur_i + di[k];
            int nxt_j = cur_j + dj[k];
            if(nxt_i >= 0 && nxt_i < n && nxt_j >= 0 && nxt_j < n && vis[nxt_i][nxt_j] == 0){
                vis[nxt_i][nxt_j] = 1;
                q.push_back(make_pair(i , make_pair(nxt_i, nxt_j) ) );
            }
        }
    }
    cout<<"Impossible"<<endl;
}

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;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}