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


int main() {
    long n,i,j,k,l,diff,flag = 0,count = 0,len = 0;
    char a[100000];
    cin>>n>>i>>j>>k>>l;
    if(i%2 == 0 && k%2 == 1)
        flag = 1;
    else if(i%2 == 1 && k%2 == 0)
        flag = 1;
    if(flag == 0){
        diff = i>k?((i-k)/2):((k-i)/2);
        if(j%2 == 0){
            if(diff%2 == 0 && l%2 == 1)
                flag = 1;
            else if(diff%2 == 1 && l%2 == 0)
                flag = 1; 
        }
        else{
            if(diff%2 == 0 && l%2 == 0)
                flag = 1;
            else if(diff%2 == 1 && l%2 == 1)
                flag = 1;
        }
    }
    if(flag == 1)
        cout<<"Impossible";
    else{
        if(i>k){
            while(i != k && j != l){
                if(j>l){
                    i -= 2;
                    j--;
                    a[len++] = 'U';
                    a[len++] = 'L';
                    a[len++] = ' ';
                    count++;
                }
                else{
                    i-= 2;
                    j++;
                    a[len++] = 'U';
                    a[len++] = 'R';
                    a[len++] = ' ';
                    count++;
                }
            }
            if(j == l && i != k){
                for(long m = 0; m<(i-k)/4; m++){
                    a[len++] = 'U';
                    a[len++] = 'R';
                    a[len++] = ' ';
                    a[len++] = 'U';
                    a[len++] = 'L';
                    a[len++] = ' ';
                }
                count += (i-k)/2;
            }
        }
        else{
            while(i != k && j != l){
                if(j>l){
                    i += 2;
                    j--;
                    a[len++] = 'L';
                    a[len++] = 'L';
                    a[len++] = ' ';
                    count++;
                }
                else{
                    i+= 2;
                    j++;
                    a[len++] = 'L';
                    a[len++] = 'R';
                    a[len++] = ' ';
                    count++;
                }
            }
            if(j == l && i != k){
                for(long m = 0; m<(k-i)/4; m++){
                    a[len++] = 'L';
                    a[len++] = 'R';
                    a[len++] = ' ';
                    a[len++] = 'L';
                    a[len++] = 'L';
                    a[len++] = ' ';
                }
                count += (k-i)/2;
            }
        }
        if(i == k && j != l){
            if(j>l){
                for(long m = 0; m<(j-l)/2; m++){
                    a[len++] = 'L';
                    a[len++] = ' ';
                }
                count += (j-l)/2; 
            }
            else{
                for(long m = 0; m<(l-j)/2; m++){
                    a[len++] = 'R';
                    a[len++] = ' ';
                }
                count += (l-j)/2;
            }
        }
        cout<<count<<"\n"<<a;
    }
    return 0;
}