#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <climits>
using namespace std;
int n;
int sx, sy;
int ex, ey;

bool isValid(int x,int y)
{
    if(x>=0 && x<n && y>=0 && y<n)
        return true;
    return false;
}
int dist(int x,int y)
{
    return abs(x-ex) + abs(y-ey);
}
bool isPossible(int sx,int sy,int ex, int ey)
{
    int v = abs(sx-ex);
    int h = abs(sy-ey);
    if(v%2==0)
    {
        int q = v/2;
        if( abs(h-q)%2 == 0 )
            return true;
        return false;
    }
    return false;
}
int main() 
{ 
    cin>>n>>sx>>sy>>ex>>ey;
    
    if(!isPossible(sx,sy,ex,ey))
    {
        cout<<"Impossible";
    }
    else
    {
        int cx = sx;
        int cy = sy;
        int nx,ny;
        vector<string> op;
        int count = 0;
        while(cx!=ex || cy!=ey)
        {
            int min = INT_MAX;
            string nxt;
            if(isValid(cx-2, cy-1) && dist(cx-2,cy-1)<min)
            {
                nx = cx-2;
                ny = cy-1;
                min = dist(cx-2,cy-1);
                nxt = "UL";
            }
            if(isValid(cx-2, cy+1) && dist(cx-2,cy+1)<min)
            {
                nx = cx-2;
                ny = cy+1;
                min = dist(cx-2,cy+1);
                nxt = "UR";
            }
            if(isValid(cx, cy+2) && dist(cx,cy+2)<min)
            {
                nx = cx;
                ny = cy+2;
                min = dist(cx,cy+2);
                nxt = "R";
            }
            if(isValid(cx+2, cy+1) && dist(cx+2,cy+1)<min)
            {
                nx = cx+2;
                ny = cy+1;
                min = dist(cx+2,cy+1);
                nxt = "LR";
            }
            if(isValid(cx+2, cy-1) && dist(cx+2,cy-1)<min)
            {
                nx = cx+2;
                ny = cy-1;
                min = dist(cx+2,cy-1);
                nxt = "LL";
            }
            if(isValid(cx, cy-2) && dist(cx,cy-2)<min)
            {
                nx = cx;
                ny = cy-2;
                min = dist(cx,cy-2);
                nxt = "L";
            }
            cx = nx;
            cy = ny;
            op.push_back(nxt);
            count++;
        }
        
        int arr[count];
        for(int i=0;i<count;i++)
        {
            if(op[i]=="UL")arr[i] = 1;
            if(op[i]=="UR")arr[i] = 2;
            if(op[i]=="R")arr[i] = 3;
            if(op[i]=="LR")arr[i] = 4;
            if(op[i]=="LL")arr[i] = 5;
            if(op[i]=="L")arr[i] = 6;
        }
        sort(arr,arr+count);
        for(int i=0;i<count;i++)
        {
            switch(arr[i])
            {
                case 1 : op[i] = "UL"; break;
                case 2 : op[i] = "UR"; break;
                case 3 : op[i] = "R" ;break;
                case 4 : op[i] = "LR"; break;
                case 5 : op[i] = "LL"; break;
                case 6 : op[i] = "L"; break;
            }
        }
        cout<<count<<"\n";
        for(int i=0;i<op.size();i++)
            cout<<op[i]<<" ";
    }
    
    return 0;
}