#include<bits/stdc++.h>
using namespace std;

#define FOR(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define pb emplace_back
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define argmax(a)    (max_element(all(a)) - (a).begin())
#define argmin(a)    (min_element(all(a)) - (a).begin())
#define dbg(args...)  {err(split(#args,',').begin(),args);}
#define tthti  template<typename Head, typename... Tail> inline
#define ttt12i template<typename T1, typename T2> inline
#define ttti   template<typename T> inline
 
inline void wr2(){cout<<"\n";}
inline void wr() {cout<<"\n";}
inline void rd()  {}
ttti void read(T &a);
ttti void priws(T a);
ttti void print(T a);
 
void err(vector<string>::iterator it){++it;}
tthti void rd (Head& head,Tail&... tail){read(head); rd  (tail...);}
tthti void wr2(Head head, Tail... tail){print(head);wr2(tail...);}
tthti void wr(Head head, Tail... tail){priws(head);wr2(tail...);}
ttti  void wr_range(T f,T s){priws(*f);for(auto i=++f;i!=s;++i)print(*i);}
tthti void err(vector<string>::iterator it,Head head,Tail...tail){wr((*it).substr((*it)[0]==' ',INT_MAX),"=",head);err(++it, tail...);}
vector<string>split(const string&s,char c){vector<string>v;stringstream ss(s);string x;while(getline(ss,x,c))v.pb(x);return move(v);}
#define a _a
#define n _n
ttt12i istream&operator>>(istream&is,pair<T1,T2>&a){return is>>a.first>>a.second;}
ttt12i ostream&operator<<(ostream&os,pair<T1,T2>&a){return os<<a.first<<" "<<a.second;}
ttti   ostream&operator<<(ostream&os,vector<T>&a){os<<a[0];for(int i=1;i<a.size();++i)os<<"\n "[is_fundamental<T>::value]<<a[i];return os;}
ttti   istream&operator>>(istream&is,vector<T>&a){if(a.size()==0){int n;is>>n;a.resize(n);}for(int i=0;i<a.size();++i)is>>a[i];return is;}
ttti void print(T a){cout<<" "<<a;}
ttti void priws(T a){cout<<a;}
ttti void read(T& a){cin>>a;}
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;

/*----------------------------------------------------------------------------------------------------*/
vector<pii > moves={{-2, -1}, {-2, 1}, {0, 2}, {2, 1}, {2, -1}, {0, -2}};
vector<string> ms={"UL", "UR", "R", "LR", "LL", "L"}, res;
int n;
pii st, en;
vector<vector<pii > > v;
vvi vs;
vvi vis;

bool isval(pii cl){
    return cl.x>=0 && cl.x<n && cl.y>=0 && cl.y<n;
}

bool bfs(){
    queue<pii> q;
    q.push(st);
    vis[st.x][st.y]=1;
    while(!q.empty()){
        pii cl=q.front();
        q.pop();
        // wr(cl.x, cl.y);
        if(cl==en){
            return true;
        }
        FOR(i, 0, 6){
            pii nxt=make_pair(cl.x+moves[i].x, cl.y+moves[i].y);
            if(isval(nxt) && !vis[nxt.x][nxt.y]){
                vis[nxt.x][nxt.y]=1;
                vs[nxt.x][nxt.y]=i;
                v[nxt.x][nxt.y]=cl;
                q.push(nxt);
            }
        }
        // c++;
    }
    return false;
}

void path(){
    pii cl=en;
    while(cl!=st){
        // cout<<cl.x<<" "<<cl.y;
        // cout<<ms[vs[cl.x][cl.y]]<<" \n";
        res.pb(ms[vs[cl.x][cl.y]]);
        cl=v[cl.x][cl.y];
    }
    // cout<<"\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    rd(n);
    rd(st.x, st.y, en.x, en.y);
    v.resize(n, vector<pii >(n));
    vis.resize(n, vi(n, 0));
    vs.resize(n, vi(n));
    if(bfs()){
        path();
        int l=(int)res.size();
        cout<<l<<"\n";
        FOR(i, res.size(), 0) cout<<res[i]<<" ";
        cout<<"\n";
    }
    else{
        wr("Impossible");
    }
}