#include <iostream>
#include <utility>
#include <queue>
#include <stack>
#include <map>
using namespace std;

int N;
bool visited[200][200];
string previ[200][200];
int s1,s2,e1,e2;
int arr1[] = {-2,-2,0,2,2,0};
int arr2[] = {-1,1,2,1,-1,-2};
string dir[] = {"UL","UR","R","LR","LL","L"};
map<string,int> m;

bool isSafe(int i,int j){
    return (i>=0 && i<N && j>=0 && j<N && !visited[i][j]);
}

void init(){
    for(int i=0;i<6;i++)
        m[dir[i]] = i;
    cin>>N;
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++)
              visited[i][j] = false;
    }
    cin>>s1>>e1>>s2>>e2;
}

void func();

void myfunc(){
    queue<pair<int,int>> q;
    q.push({s1,e1});
    visited[s1][e1] = true;
    previ[s1][e1] = "NULL";
    int dist = 0;
    int n = 1;
    while(n){
        int count = 0;
        for(int i=0;i<n;i++){
            pair<int,int> temp = q.front();
            q.pop();
            if(temp.first==s2 && temp.second==e2){
                cout<<dist<<endl;
                func();
                return;
            }
            for(int j=0;j<6;j++){
                int x = temp.first + arr1[j];
                int y = temp.second + arr2[j];
                if(isSafe(x,y)){
                    q.push({x,y});
                    visited[x][y] = true;
                    previ[x][y] = dir[j];
                    count++;
                }
            }
        }
        n = count;
        dist++;
    }
    cout<<"Impossible";
}

void func(){
    string str = previ[s2][e2];
    stack<string> S;
    int x=s2,y=e2;
    while(str!="NULL"){
        S.push(str);
        x = x-arr1[m[str]];
        y = y-arr2[m[str]];
        str = previ[x][y];
    }
    while(!S.empty()){
        cout<<S.top()<<" ";
        S.pop();
    }
}

int main() {
    init();
    myfunc();
    return 0;
}