#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
using namespace std;

vector<string> GetMinimal(int rows, int istart, int jstart, int iend, int jend)
{
    queue<pair<int,int>> q;
    int row[] = {-2,-2,0,2, 2,0};
    int col[] = {-1, 1,2,1,-1,-2};
    string sms[] = {"UL","UR","R","LR","LL","L"};
    set<pair<int,int>>s;
    map<pair<int,int>,pair<int,int>> m;
    map<pair<int,int>, string> sm;
    q.push(std::make_pair(istart,jstart));
    s.insert(std::make_pair(istart,jstart));
    bool found = false;
    while(not q.empty()){
        auto x = q.front();
        q.pop();
        for(int i=0; i<6 && not found;i++){
            int newrow = x.first + row[i];
            if(newrow < 0 || newrow >= rows) continue;
            int newcol = x.second + col[i];
            if(newcol <0 || newcol >= rows ) continue;
            auto pr = std::make_pair(newrow, newcol);
            if(s.find(pr) == s.end()){
                m[pr] = x;
                //cout<<x.first<<x.second<<sms[i]<<endl;
                //cout<<newrow<<","<<newcol<<endl;
                //cout<<iend<<jend<<endl;
                sm[pr] =  sms[i];
                if((newrow == iend) && (newcol == jend)){
                    found = true;
                    break;
                }
                q.push(pr);
                s.insert(pr);
            }
        }
    }
    vector<string> ss;
    if(not found) return ss;
    auto pr = std::make_pair(iend, jend);
    auto st = std::make_pair(istart, jstart);
    while(pr != st){
        string str = sm[pr];
        ss.push_back(str);
        pr = m[pr];
    }
    reverse(ss.begin(),ss.end());
    return ss;
}    
    

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int rows;
    cin >> rows;
    int istart, jstart, iend, jend;
    cin >> istart;
    cin >> jstart;
    cin >> iend;
    cin >> jend;
    vector<string> steps = GetMinimal(rows, istart, jstart, iend, jend);
    if(steps.size() == 0)
        cout<<"Impossible"<<endl;
    else
    {
        cout<<steps.size()<<endl;
        for(int i=0; i < steps.size();i++)
            cout<<steps[i]<<" ";
        cout<<endl;
    }
    return 0;
}