#include <bits/stdc++.h>

using namespace std;

bool vis[201][201];
map<pair<int,int>,pair<int,int>> par;
int dx[]={-1,1,2,1,-1,-2};
int dy[]={-2,-2,0,2,2,0};

void finish(pair<int,int> cur, int lvl){
    string pth[]={"UL","UR","R","LR","LL","L"};
    map<pair<int,int>,int> xp;
    for(int i=0;i<6;i++)
        xp[make_pair(dx[i],dy[i])]=i;
    
    string path;
    
    pair<int,int> df;
    cout << lvl << endl;
    for(int i=0;i<lvl;i++){
        df.first=cur.first-par[cur].first;
        df.second=cur.second-par[cur].second;
        path = pth[xp[df]] + ' ' + path;
        cur=par[cur];
    }
    cout << path;
    exit(0);
}


void printShortestPath(int n, int y1, int x1, int y2, int x2) {
    //  Print the distance along with the sequence of moves.
    int lvl=0;
    pair<int,int> cur=make_pair(x1,y1);
    queue<pair<int,int>> q;
    vector<int> path;
    q.push(cur);
    //par[cur]=make_pair(-1,-1);
    vis[x1][y1]=1;
    while (!q.empty()){
        int sz=q.size();
        lvl++;
        while (sz--){
            int xr=q.front().first,yr=q.front().second;
            q.pop();
            for(int i=0;i<6;i++){
                cur.first=xr+dx[i];
                cur.second=yr+dy[i];
                if (cur.first>=0 && cur.second>=0 && cur.first<n && cur.second<n)
                    if (!vis[cur.first][cur.second]){
                        q.push(cur);
                        vis[cur.first][cur.second]=1;
                        par[cur]=make_pair(xr,yr);
                        if (cur.first==x2 && cur.second==y2)
                            finish(cur, lvl);
                    }
            }
        }
    }
    printf("Impossible\n");
}

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