#include <bits/stdc++.h>
#define pii pair<int,int>

using namespace std;

map<pii, string> dir = { 
                           {{-2,-1},"UL"}, 
                           {{-2,1}, "UR"},
                           {{0,2}, "R"},
                           {{2,1}, "LR"},
                           {{2,-1}, "LL"},
                           {{0,-2}, "L"},
                          };

vector<pii> dirV = { {-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};

bool check(int cx, int cy, int n){
    if(cx < 0 || cy<0){
        return false;
    }
    if(cx>=n || cy>=n){
        return false;
    }
    
    return true;
}

void print(pii end,map<pii,pii> &parent ){
    stack<string> s;
    
    while(parent[end]!=make_pair(-1,-1)){
        //cout<<end.first<<" "<<end.second<<endl;
        pii par = parent[end];
        string d = dir[make_pair(end.first - par.first, end.second - par.second)];
        s.push(d);
        end = parent[end];
    }
    
    while(!s.empty()){
        cout<<s.top()<<" ";
        s.pop();
        if(s.empty()){
            cout<<endl;
        }
    }
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    
    queue<pii> q;
    set<pii> visited;
    map<pii,pii> parent;
    map<pii,int> moves;
    
    q.push({i_start,j_start});
    visited.insert({i_start,j_start});
    parent[{i_start,j_start}]= {-1,-1};
    moves[{i_start,j_start}]=0;
    
    while(!q.empty()){
        pii curr = q.front();
        q.pop();
        
        /*if(curr==make_pair(i_end,j_end)){
            cout<<moves[{i_end,j_end}]<<endl;
            print({i_end,j_end}, parent);
            return;
        }*/
        
        for(int a =0;a<dirV.size();a++){
            
            int cx = curr.first + dirV[a].first ;
            int cy = curr.second + dirV[a].second;
            //cout<<curr.first<<" "<<curr.second<<" "<<it->first.first<<" "<< it->first.second<<" "<<cx<<" "<<cy<<endl;
            if(check(cx,cy,n) && visited.find({cx,cy})==visited.end()){
                q.push({cx,cy});
                visited.insert({cx,cy});
                parent[{cx,cy}]=curr;
                moves[{cx,cy}]=moves[curr]+1;
                if(cx==i_end && cy ==j_end){
                    cout<<moves[{i_end,j_end}]<<endl;
                    print({i_end,j_end}, parent);
                    return;
                }
            }
        }
    }
    
    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;
}