#include <bits/stdc++.h>

using namespace std;
#define F first
#define S second
pair<int,int> moves[] = {{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};
string moves1[] = {"UL","UR","R","LR","LL","L"};
bool is_safe(int s1,int s2,int n){
    if(s1<n and s2<n and s1>=0 and s2>=0)
        return true;
    return false;
}
string get_move(pair<int,int> &s,pair<int,int> &e){
    for(int i=0;i<6;++i){
        if(s.F+moves[i].F==e.F and s.S+moves[i].S==e.S)
            return moves1[i];
    }
    return "+";
}
int start(int s1,int s2,int e1,int e2,int n,vector<vector<int> > &cost,vector<vector<pair<int,int> > > &path){
    queue<pair<int,int> > q;
    q.push({s1,s2});
    cost[s1][s2] = 0;
    while(!q.empty()){
        pair<int,int> s = q.front();
        q.pop();
        if(s.F==e1 and s.S==e2)
            break;
        for(int i=0;i<6;++i){
            int s1_1 = s.F + moves[i].F;
            int s2_1 = s.S + moves[i].S;
            if(is_safe(s1_1,s2_1,n) and cost[s1_1][s2_1]==-1){
                q.push({s1_1,s2_1});
                //cout<<"at "<<s1_1<<","<<s2_1<<" ="<< cost[s.F][s.S]+1<<endl;
                cost[s1_1][s2_1] = cost[s.F][s.S]+1;
                path[s1_1][s2_1] = {s.F,s.S};
            }
        }
    }
    //cout<<"over"<<endl;
    return cost[e1][e2];
}
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    vector<vector<int> > cost(n,vector<int>(n,-1));
    vector<vector<pair<int,int> > > path(n,vector<pair<int,int> >(n));
    
    int x = start(i_start,j_start,i_end,j_end,n,cost,path);
    
    if(x==-1){
        cout<<"Impossible"<<endl;
    }
    else{
        cout<<cost[i_end][j_end]<<endl;
        vector<string> str;
        
        pair<int,int> e = {i_end,j_end};
        while(e!=make_pair(i_start,j_start)){
            //cout<<"from "<<path[e.F][e.S].F<<","<<path[e.F][e.S].S<<" to "<<e.F<<","<<e.S<<endl;
            string s = get_move(path[e.F][e.S],e);
            str.push_back(s);
            e = path[e.F][e.S];
        }
        reverse(str.begin(),str.end());
        for(auto &a:str)
            cout<<a<<" ";
        cout<<endl;
            
                //for(auto &a:path[i_start][j_start])
                 //   cout<<a<<" ";
                
            
        
        //cout<<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;
}