#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    pair<int,int> beg(i_start,j_start);
    pair<int,int> end(i_end,j_end);
    queue< pair<int,int> > q;
    int i, mark[n][n], dist[n][n];
    string moves[n][n];
    pair<int,int> par[n][n];
    for(i=0; i<n; i++){
        int j;
        for(j=0; j<n; j++){
            mark[i][j] = 0;
            dist[i][j] = 1000000;
        }
    }
    q.push(beg);
    mark[i_start][j_start] = 1;
    dist[i_start][j_start] = 0;
    par[i_start][j_start] = beg;
    
    while(!q.empty()){
        pair<int,int> cur = q.front();
        q.pop();
        //cout<<cur.first<<" "<<cur.second<<endl;
        
        if( cur == end ){
            cout<<dist[cur.first][cur.second]<<endl;
            vector<string> ms;
            while(1){
                ms.push_back( moves[cur.first][cur.second] );
                if(beg == par[cur.first][cur.second]){
                    break;
                }
                cur = par[cur.first][cur.second];
            }
            reverse(ms.begin(), ms.end());
            for(int i=0; i<ms.size(); i++){
                cout<<ms[i]<<" ";
            }
            return;
        }
        
        if(cur.first-2 >= 0 && cur.second-1 >= 0 && mark[cur.first-2][cur.second-1] == 0){
            q.push(make_pair(cur.first-2,cur.second-1));
            mark[cur.first-2][cur.second-1] = 1;
            dist[cur.first-2][cur.second-1] = dist[cur.first][cur.second] + 1;
            par[cur.first-2][cur.second-1] = cur;
            moves[cur.first-2][cur.second-1] = "UL";           
        }
        if(cur.first-2 >= 0 && cur.second+1 < n && mark[cur.first-2][cur.second+1] == 0){
            q.push(make_pair(cur.first-2,cur.second+1));
            mark[cur.first-2][cur.second+1] = 1;
            dist[cur.first-2][cur.second+1] = dist[cur.first][cur.second] + 1;
            par[cur.first-2][cur.second+1] = cur;
            moves[cur.first-2][cur.second+1] = "UR";            
        }
        if(cur.second+2 < n && mark[cur.first][cur.second+2] == 0){
            q.push(make_pair(cur.first,cur.second+2));
            mark[cur.first][cur.second+2] = 1;
            dist[cur.first][cur.second+2] = dist[cur.first][cur.second] + 1;
            par[cur.first][cur.second+2] = cur;
            moves[cur.first][cur.second+2] = "R";
        }
        if(cur.first+2 < n && cur.second+1 < n && mark[cur.first+2][cur.second+1] == 0){
            q.push(make_pair(cur.first+2,cur.second+1));
            mark[cur.first+2][cur.second+1] = 1;
            dist[cur.first+2][cur.second+1] = dist[cur.first][cur.second] + 1;
            par[cur.first+2][cur.second+1] = cur;
            moves[cur.first+2][cur.second+1] = "LR";           
        }
        if(cur.first+2 < n && cur.second-1 >= 0 && mark[cur.first+2][cur.second-1] == 0){
            q.push(make_pair(cur.first+2,cur.second-1));
            mark[cur.first+2][cur.second-1] = 1;
            dist[cur.first+2][cur.second-1] = dist[cur.first][cur.second] + 1;
            par[cur.first+2][cur.second-1] = cur;
            moves[cur.first+2][cur.second-1] = "LL";            
        }
        if(cur.second-2 >= 0 && mark[cur.first][cur.second-2] == 0){
            q.push(make_pair(cur.first,cur.second-2));
            mark[cur.first][cur.second-2] = 1;
            dist[cur.first][cur.second-2] = dist[cur.first][cur.second] + 1;
            par[cur.first][cur.second-2] = cur;
            moves[cur.first][cur.second-2] = "L";
        }
    }
    
    cout<<"Impossible";
}

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;
}