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

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<long long, long long> l4;
typedef vector<long long> vll;
typedef double db;
typedef vector<double> vdb;
typedef pair<double, double> dd;
typedef set<int> si;
typedef set<long long> sll;
#define fi first
#define se second
#define matrix(a) vector< vector<a> >
#define sz(a) int((a).size()) 
#define lop(i,a,b) for (int i=a; i<=b; i++)
#define rlop(i,a,b) for (int i=b; i>=a; i--)
#define all(s) (s).begin(),(s).end()
#define pb push_back
#define enter cout<<'\n'
#define lb(i,v) int(lower_bound(all(v),i)-v.begin())
#define ub(i,v) int(upper_bound(all(v),i)-v.begin())
int n,is,js,ie,je,im,jm;
vector<ii> moves(6);
vector<string> movename={"UL","UR","R","LR","LL","L"};

void printans(matrix(int)& prev){
    vi step;
    int it=ie,jt=je,t;
    while(it!=is||jt!=js){
        step.pb(prev[it][jt]);
        t=prev[it][jt];
        it-=moves[t].fi;
        jt-=moves[t].se;
    }
    cout<<sz(step)<<'\n';
    rlop(i,0,sz(step)-1)cout<<movename[step[i]]<<" ";
    return;
}

int main() {
    cin>>n;
    moves[0]=ii(-2,-1);
    moves[1]=ii(-2,1);
    moves[2]=ii(0,2);
    moves[3]=ii(2,1);
    moves[4]=ii(2,-1);
    moves[5]=ii(0,-2);
    matrix(int) grid(n,vi(n,0)),prev(n,vi(n));
    cin>>is>>js>>ie>>je;
    deque<ii> q;
    q.pb(ii(is,js));
    grid[is][js]=1;
    while(!q.empty()){
        int in,jn;
        im=q.front().fi;
        jm=q.front().se;
        q.pop_front();
        /*cout<<im<<" "<<jm<<endl;*/
        lop(i,0,5){
            in=im+moves[i].fi;
            jn=jm+moves[i].se;
            if(in>=0&&in<n&&jn>=0&&jn<n){
                if(!grid[in][jn]){
                    grid[in][jn]=1;
                    q.pb(ii(in,jn));
                    prev[in][jn]=i;
                    if(in==ie&&jn==je){
                        printans(prev);
                        return 0;
                    }
                }
            }
        }
    }
    cout<<"Impossible";
    return 0;
}