#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int modd(int a){
    if(a<0)
        return -a;
    else
        return a;
}
int main() {
    int n;
    cin>>n;
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    vector<string> temp;
    while(a!=c || b!=d){
        if(a-c>=2 && b>d){
            temp.push_back("UL");
            a = a-2;
            b = b-1;
        }
        else if(a-c>=2 && b<d){
            temp.push_back("UR");
            a = a-2;
            b = b+1;
        }
        else if(a-c==0 && d-b>=2){
            temp.push_back("R");
            b = b+2;
        }
        else if(c-a>=2 && d>b){
            temp.push_back("LR");
            a=a+2;
            d=b+1;
        }
        else if(c-a>=2 && d<b){
            temp.push_back("LL");
            a=a+2;
            b=b-1;
        }
        else if(c-a==0 && b>d){
            temp.push_back("L");
            b = b-2;
        }
        else
            break;
    }
    if(a==c && b==d){
        cout<<temp.size()<<endl;
        for(int i=0;i<temp.size();++i)
            cout<<temp[i]<<" ";
    }
    else
        cout<<"Impossible";
    return 0;
}