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

#define ll long long
#define ull unsigned long long
#define ld long double

typedef pair<int, int>	pi;
typedef pair<ll, ll>	pll;
typedef vector<int>		vi;
typedef vector<ll>		vl;
typedef vector<pi>		vpi;
typedef vector<pll>		vpll;
typedef vector<vi>		vvi;
typedef vector<vl>		vvl;

#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define sub(a,b) a-b
#define orr(a,b) a||b
#define si(x)	scanf("%d",&x)
#define sl(x)	scanf("%lld",&x)
#define ss(s)	scanf("%s",s)
#define pi(x)	printf("%d\n",x)
#define pl(x)	printf("%lld\n",x)
#define ps(s)	printf("%s\n",s)
#define slen(s) strlen(s)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define boostIO ios_base::sync_with_stdio(false), cin.tie(0)
#define tc(t) ll t; cin >> t; while(t--)
#define PI 3.1415926535897932384626
#define beg int main()
#define ret return 0
#define bye exit(0)
#define nxl <<endl
#define show cout<<
#define INF 0x3f3f3f3f
#define MAX 200000
#define mod 1000000007

ll power2(ll a, ll b) { if(b == 0) return 1; if(b == 1) return a; ll x = power2(a, b / 2); x = x * x; if(b % 2) x = x * a; return x;}
ll gcd(ll a, ll b) {if(a < b) swap(a, b); while(b) {ll t = b; b = a % b; a = t;} return a;}
ll mul(ll a, ll b, ll m = mod) { return (ll)(a * b) % m;}
ll add(ll a, ll b, ll m = mod) { a += b; if(a >= m) a -= m; if(a < 0) a += m; return a;}
ll power(ll a, ll b, ll m = mod) { if(b == 0) return 1; if(b == 1) return (a % m); ll x = power(a, b / 2, m); x = mul(x, x, m); if(b % 2) x = mul(x, a, m); return x;}


// ll bin_ser(ll low,ll high,ll key){

//    while(low<=high){
//        ll mid = (low+high)/2;
//        if(v1[mid]<key){
//            low = mid+1;
//        }
//        else if(v1[mid]>key){
//            high = mid-1;
//        }
//        else{
//            return (mid+1);
//        }
//    }
//    return -1;
// }

bool yoyo(const ll p1 ,const ll p2){
    return p1 > p2;
}

vl prio;

 struct compare
 {
   bool operator()(const pair<pll,pair<vector<string>,pll> > l, const pair<pll,pair<vector<string>,pll> > r)
   {
       if(l.F.F==r.F.F) return l.F.S < r.F.S;
       return l.F.F > r.F.F;
   }
 };

beg{

ll i,j,k,l,is,js,ie,je,t,a,r,n,m,b,c;
cin >> n;
cin >> is >> js >> ie >> je;
ll vis[n+3][n+3];
clr(vis);
for(i=1;i<7;i++){
    prio.pb(i);
}
priority_queue<pair<pll,pair<vector<string>,pll> >, vector<pair<pll,pair<vector<string>,pll> > >, compare > qu;

vector<string> vs;

qu.push({{0,-1},{vs,{is,js}}});

vpll arr1;
arr1.pb({-2,-1});
arr1.pb({-2,1});
arr1.pb({0,2});
arr1.pb({2,1});
arr1.pb({2,-1});
arr1.pb({0,-2});
vector<string> val;
val.pb("UL");
val.pb("UR");
val.pb("R");
val.pb("LR");
val.pb("LL");
val.pb("L");
while(!qu.empty()){
    pair<pll,pair<vector<string>,pll> > ab = qu.top();
    qu.pop();
    ll mov = ab.F.F;
    ll pr = ab.F.S;
    ll n1 = ab.S.S.F;
    ll n2 = ab.S.S.S;
    vector<string> vf;
    vf = ab.S.F;
    if(n1==ie && n2==je){
        cout<<mov<<endl;
        fo(i,vf.size()){
            cout<<vf[i]<<" ";
        }
        bye;
    }
    if(vis[n1][n2]) continue;
    vis[n1][n2] = 1;

    for(i=0;i<6;i++){
        vector<string> vte;
        vte = vf;
        ll te1 = n1 + arr1[i].F;
        ll te2 = n2 + arr1[i].S;
        if((te1>=0 && te1<=(n-1)) && (te2>=0 && te2<=(n-1))){
            vte.pb(val[i]);
            qu.push({{mov+1,prio[i]},{vte,{te1,te2}}});
        }
    }
}
cout<<"Impossible"<<endl;


ret;
}