#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <map>
#include <stack>
using namespace std;

typedef pair<int,int> ii;

void bfs(pair<int,int>,pair<int,int>);

vector<ii> adj_list[205][205];
bool visited[205][205]={false};
map<ii,pair<int,string> > dist;

int main() {
    int n;
    cin>>n;
    pair<int,int> source,end;
    cin>>source.first>>source.second>>end.first>>end.second;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(i<2&&j<1)
            {
                adj_list[i][j].push_back(make_pair(i,j+2));
                adj_list[i][j].push_back(make_pair(i+2,j+1));
            }
            else if(i<2&&j>=1)
            {
                if(j!=1)
                    adj_list[i][j].push_back(make_pair(i,j-2));
                adj_list[i][j].push_back(make_pair(i+2,j-1));
                if(j<n-1)
                    adj_list[i][j].push_back(make_pair(i+2,j+1));
                if(j<n-2)
                    adj_list[i][j].push_back(make_pair(i,j+2));
            }
            else if(i>=2&&j<1)
            {
                adj_list[i][j].push_back(make_pair(i-2,j+1));
                adj_list[i][j].push_back(make_pair(i,j+2));
                if(i<n-2)
                    adj_list[i][j].push_back(make_pair(i+2,j+1));
            }
            else if(i>=2&&j>=1)
            {
                if(j!=1)
                    adj_list[i][j].push_back(make_pair(i,j-2));
                adj_list[i][j].push_back(make_pair(i-2,j-1));
                if(j<n-1)
                    adj_list[i][j].push_back(make_pair(i-2,j+1));
                if(j<n-2)
                    adj_list[i][j].push_back(make_pair(i,j+2));
                if(i<n-2&&j<n-1)
                    adj_list[i][j].push_back(make_pair(i+2,j+1));
                if(i<n-2)
                    adj_list[i][j].push_back(make_pair(i+2,j-1));
            }
        }
    }
    bfs(source,end);
    return 0;
}

void bfs(ii source,ii end)
{
    visited[source.first][source.second]=true;
    dist[make_pair(source.first,source.second)]=make_pair(0,"0");
    queue<ii> q;
    q.push(make_pair(source.first,source.second));
    while(!q.empty())
    {
        ii temp=q.front();
        q.pop();
        for(auto it=adj_list[temp.first][temp.second].begin();it!=adj_list[temp.first][temp.second].end();it++)
        {
            if(!visited[it->first][it->second])
            {
                visited[it->first][it->second]=true;
                q.push(make_pair(it->first,it->second));
                if(it->first==temp.first&&it->second==temp.second-2)
                    dist[make_pair(it->first,it->second)]=make_pair(1+dist[make_pair(temp.first,temp.second)].first,"R");
                else if(it->first==temp.first&&it->second==temp.second+2)
                    dist[make_pair(it->first,it->second)]=make_pair(1+dist[make_pair(temp.first,temp.second)].first,"L");
                else if(it->first==temp.first-2&&it->second==temp.second-1)
                    dist[make_pair(it->first,it->second)]=make_pair(1+dist[make_pair(temp.first,temp.second)].first,"LR");
                else if(it->first==temp.first-2&&it->second==temp.second+1)
                    dist[make_pair(it->first,it->second)]=make_pair(1+dist[make_pair(temp.first,temp.second)].first,"LL");
                else if(it->first==temp.first+2&&it->second==temp.second-1)
                    dist[make_pair(it->first,it->second)]=make_pair(1+dist[make_pair(temp.first,temp.second)].first,"UR");
                else if(it->first==temp.first+2&&it->second==temp.second+1)
                    dist[make_pair(it->first,it->second)]=make_pair(1+dist[make_pair(temp.first,temp.second)].first,"UL");
            }
        }
    }
    stack<string> s,result;
    if(visited[end.first][end.second]==false)
        cout<<"Impossible\n";
    else
    {
        cout<<dist[make_pair(end.first,end.second)].first<<"\n";
        while(dist[make_pair(end.first,end.second)].second.compare("0")!=0)
        {
            if(dist[make_pair(end.first,end.second)].second.compare("R")==0)
            {
                s.push("L");
                end=make_pair(end.first,end.second+2);
            }
            else if(dist[make_pair(end.first,end.second)].second.compare("LR")==0)
            {
                s.push("UL");
                end=make_pair(end.first+2,end.second+1);
            }
            else if(dist[make_pair(end.first,end.second)].second.compare("LL")==0)
            {
                end=make_pair(end.first+2,end.second-1);
                s.push("UR");
            }
            else if(dist[make_pair(end.first,end.second)].second.compare("L")==0)
            {
                s.push("R");
                end=make_pair(end.first,end.second-2);
            }
            else if(dist[make_pair(end.first,end.second)].second.compare("UL")==0)
            {
                s.push("LR");
                end=make_pair(end.first-2,end.second-1);
            }
            else if(dist[make_pair(end.first,end.second)].second.compare("UR")==0)
            {
                s.push("LL");
                end=make_pair(end.first-2,end.second+1);
            }
            
        }
        while(!s.empty())
        {
            result.push(s.top());
            s.pop();
        }
        while(!result.empty())
        {
            cout<<result.top()<<" ";
            result.pop();
        }
    }
}