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

int r[6]={-1,1,2,1,-1,-2};
int l[6]={-2,-2,0,2,2,0};
string val[6]={"UL", "UR", "R", "LR", "LL", "L"};
int mi=0;
map<pair<int,int>,int> m;
map<pair<int,int>,pair<int,int>> from;
vector<vector<string>> st(200,vector<string>(200));
vector<string> v;
vector<vector<bool>> vis(200,vector<bool>(200,false));



int main() {
    int n;
    cin>>n;
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    vis[a][b]=true;
    list<pair<int,int>> q;
    q.push_back(make_pair(a,b));
    m[make_pair(a,b)]=0;
    while( !q.empty()){
        int x=q.front().first;
        int y=q.front().second;
        if(x==c && y==d){
            break;
        }
        q.pop_front();
        for(int i=0;i<6;i++){
            if(x+l[i]>=0 && x+l[i]<n && y+r[i]>=0 && y+r[i]<n && !vis[x+l[i]][y+r[i]]){
                vis[x+l[i]][y+r[i]]=true;
                q.push_back(make_pair(x+l[i],y+r[i]));
                m[make_pair(x+l[i],y+r[i])]=m[make_pair(x,y)]+1;
                st[x+l[i]][y+r[i]]=val[i];
                from[make_pair(x+l[i],y+r[i])]=make_pair(x,y);
                
            }
        }
    }
    
    if(q.size()>0){
        cout<<m[make_pair(c,d)]<<endl;
        int g=c,h=d;
        vector<string> ans;
        while(g!=a || h!=b){
            ans.push_back(st[g][h]);
            int j=from[make_pair(g,h)].first;
            int k=from[make_pair(g,h)].second;
            g=j,h=k;
        }
        for(int i=ans.size()-1;i>=0;i--){
            cout<<ans[i]<<" ";
        }
        cout<<endl;
    }else{
        cout<<"Impossible"<<endl;
    }
    return 0;
}