#include<bits/stdc++.h>

using namespace std;

int dy[6] = {-1,1,2,1,-1,-2};
int dx[6] = {-2,-2,0,2,2,0};

map<pair<int,int>,bool> vis;
//map<pair<int,int>,pair<int,int>> parent;

bool valid(int x,int y,int n) {
    if(x<0 || y<0 || x>=n || y>=n)
        return false;
    return true;
}

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<pair<pair<pair<int, int>, int>,vector<string>> > q;
    //vis[make_pair(i_start,j_start)] = 1;
    vector<string> vec;
    q.push(make_pair(make_pair(make_pair(i_start,j_start),0),vec));
    //parent[make_pair(i_start,i_end)] = make_pair(-1,-1);
    while(!q.empty()) {
        pair<pair<pair<int, int>, int>,vector<string>> temp = q.front();
	    q.pop();

      
        int x = temp.first.first.first;
        int y = temp.first.first.second;
        int dis = temp.first.second + 1;
        
        if(x == i_end && y == j_end) {
            cout<<dis-1<<endl;
                    for(int j=0;j<temp.second.size();j++) {
                        cout<<temp.second[j]<<" ";
                    }
                    
                    cout<<endl;
                    return;
        }
       /* if(vis.count(make_pair(x, y)))
            continue;
        vis[make_pair(x, y)] = true;*/
        
        for(int i = 0; i < 6; ++i) {
		    int x1 = x + dx[i];
            int y1 = y + dy[i];
            vector<string> vec1;
            for(int j=0;j<temp.second.size();j++) {
                vec1.push_back(temp.second[j]);
            }
                
            if(valid(x1, y1, n) && vis[make_pair(x1,y1)] != true) {
                /*if(x1 == i_end && y1 == j_end) {
                    cout<<dis<<endl;
                    for(int j=0;j<temp.second.size();j++) {
                        cout<<temp.second[j]<<" ";
                    }
                    
                    cout<<endl;
                    return;
                }*/
                if(i == 0) {
                    vec1.push_back("UL");
                }
                if(i == 1) {
                    vec1.push_back("UR");
                }
                if(i == 2) {
                    vec1.push_back("R");
                }
                if(i == 3) {
                    vec1.push_back("LR");
                }
                if(i == 4) {
                    vec1.push_back("LL");
                }
                if(i == 5) {
                    vec1.push_back("L");
                }  
                vis[make_pair(x1,y1)] = true;
                q.push(make_pair(make_pair(make_pair(x1, y1), dis),vec1));
            }
        }
       /* for(int i=0;i<q.size();i++) {
            cout<<"("<<q.front().first.first<<","<<q.front().first.second<<")"<<" ";
        }
        cout<<endl;*/
    }
    cout<<"Impossible"<<endl;
    return;
}

int main() {
    int n; 
    scanf("%i", &n);
    int i_start; 
    int j_start; 
    int i_end; 
    int j_end; 
    //cout<<vis[make_pair(0,0)]<<endl;
    scanf("%i %i %i %i", &i_start, &j_start, &i_end, &j_end);
    printShortestPath(n, i_start, j_start, i_end, j_end);
    //printf("%d",ans);
    return 0;
}