#include <bits/stdc++.h>

using namespace std;
int v[200][200];
int n,ie,je;
vector<int>q;
vector<string>p;
int mi=INT_MAX;
void psp(int i, int j,int cnt)
{
    //  Print the distance along with the sequence of moves.
   
    if(i>=n||i<0||j>=n||j<0)
        return;
    if(v[i][j])
       return;
    v[i][j]=1;
    // cout<<"move to"<<i<<" "<<j<<'\n';
    if(i==ie&&j==je)
    {
        
        if(q.size()<mi)
        {
            mi=q.size();
            p.clear();
        for(int e:q)
        {
            switch(e)
            {
                case 1:p.push_back("UL");break;
                case 2:p.push_back("UR");break;
                case 3:p.push_back("R");break;
                case 4:p.push_back("LR");break;
                case 5:p.push_back("LL");break;
                case 6:p.push_back("L");break;
            }
        }
        }
           v[i][j]=0;
           return;
       }
        q.push_back(1);
        psp(i-2,j-1,cnt+1);
            
         q.pop_back();
        q.push_back(2);
        psp(i-2,j+1,cnt+1);
       q.pop_back();
        q.push_back(3);
        psp(i,j+2,cnt+1);
         q.pop_back();
         q.push_back(4);
        psp(i+2,j+1,cnt+1);
          q.pop_back();
         q.push_back(5);
        psp(i+2,j-1,cnt+1);
         q.pop_back();
          q.push_back(6);
        psp(i,j-2,cnt+1);
           q.pop_back();
    v[i][j]=0;
        return;
}

int main()
{
//    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    for(int i=0;i<200;++i)
        for(int j=0;j<200;++j)
            v[i][j]=0;
    cin >> n;
    int i_start;
    int j_start;
    cin >> i_start >> j_start >> ie >> je;
    psp(i_start, j_start,0);
    
    if(mi==INT_MAX)
    cout<<"Impossible";
    else
    {
        cout<<p.size()<<'\n';
        for(string s:p)
            cout<<s<<' ';
    }
    return 0;
}