#include <iostream>
#include<algorithm>
#include<iomanip>
#include<string.h>
#include<unordered_map>
#include<map>
#include<cmath>
#include<vector>
#include<iomanip>
#include<queue>
using namespace std;
#define inf 100000000
#define x first
#define y second
#define ll long long
#define ii pair<ll, ll>
#define vi vector<ll>
#define pb push_back
#include<set>
#define mp make_pair
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll n, k;
ll vis[205][205];
ll c, d;
queue<ii>q;

ll dfs(ll a, ll b){
    if(a<0 || b<0 || a>=n || b>=n) return 0;
    if(a==c && b==d) return 1;
    if(vis[a][b]) return 0;
    vis[a][b]= 1;
    if(dfs(a-2, b-1) || dfs(a+2, b-1) || dfs(a-2, b+1) || dfs(a+2, b+1) || dfs(a, b+2) || dfs(a, b-2) ) return 1;
    return 0;
}

int main()
{
    ios
    ll i, j, a, b;
    cin>>n;

    cin>>a>>b>>c>>d;

    if(!dfs(a, b)) {
        cout<<"Impossible";
        return 0;
    }
    vi v;
    
    while(a!= c || b!= d){
        if(a== c ){
            if(b<d){
                v.pb(3);
                b += 2;
            }
            else if(b>d) v.pb(6), b-=2;
        }
        else if(a>c){
            if(b<d)
                v.pb(2), a-=2, b+= 1;
            else v.pb(1), a-= 2, b-= 1;
        }
        else if(a<c){
            if(b<=d) v.pb(4), a+= 2, b+= 1;
            else v.pb(5), a+= 2, b-= 1;
        }
 //       cout<<a<<" "<<b<<"\n";
    }
    

    sort(v.begin(), v.end());
    cout<<v.size()<<"\n";
    map<ll, string>mp;
    mp[1]= "UL"; mp[2]= "UR"; mp[3]= "R"; mp[4]= "LR"; mp[5]= "LL"; mp[6]= "L";
    i=0;
    while(i<v.size()){
        cout<<mp[v[i]]<<" ";
        i++;
    }
}