#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int n,si,sj,ei,ej,k=0,pos[500];

void move(int num)
{
    switch(num)
    {
        case 1: si=si-2;
                sj=sj-1;
        break;
        case 2: si=si-2;
                sj=sj+1;
        break;
        case 3: sj=sj+2;
        break;
        case 4: si=si+2;
                sj=sj+1;
        break;
        case 5: si=si+2;
                sj=sj-1;
        break;
        case 6: sj=sj-2;
        break;
    }
    pos[k++]=num;
}

int main() {
    cin>>n>>si>>sj>>ei>>ej;
    if((si-ei)%2==0)
    {
        while(si<n && sj<n && si>0 && sj>0)
        {
          if(si==ei && sj==ej)
          {
              break;
          }
        while(ei<si) //upwards
        {   
            if(ej<sj) //leftwards ul
            {
                move(1);
            }
            if(ej==sj)
            {
                int p=(si-ei)/4;
                for(int count=0;count<p;count++)
            {
                move(1);
                move(2);
            }
            }
            if(ej>sj) //rightwards ur
            {
                move(2);
            }
        }
        while(ei==si && ej>sj) //rightwards r
        {
            move(3);
            if(ej<sj) //crosses final location while moving right
            {cout<<"Impossible";
             exit(1);
            }
        }
        while(ei>si) //downwards
        {
            if(ej>sj) //rightwards lr
            {
                move(4);
            }
            if(ej==sj)
            {
                int p=(si-ei)/4;
                for(int count=0;count<p;count++)
                {
                     move(4);
                     move(5);
                }
            }
            if(ej<sj) //leftwards ll
            {
                move(5);
            }
        }
        while(ei==si && ej<sj) //leftwards l
        {
            move(6);
            if(ej>sj){ //crosses final location while moving left
                cout<<"Impossible";
                exit(1);
            }
        }
        }
        cout<<k<<endl;
        for(int i=0;i<k;i++)
        {
            switch(pos[i])
            {
                case 1: cout<<"UL";
                break;
                case 2:cout<<"UR";
                break;
                case 3: cout<<"R";
                break;
                case 4: cout<<"LR";
                break;
                case 5: cout<<"LL";
                break;
                case 6: cout<<"L";
                break;
            }
            cout<<" ";
        }
    }
    else
        cout<<"Impossible";
    return 0;
}