#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    if(abs(i_start-i_end)%2==1) {cout<<"Impossible";return;}
    vector<string> v;
    while(i_start!=i_end){
        if(i_start<i_end){
            if(j_start<j_end) {j_start++;v.push_back("LR");}
            else {v.push_back("LL");j_start--;}
            i_start+=2;
        }
        else{
            if(j_start<j_end) {j_start++;v.push_back("UR");}
            else {v.push_back("UL");j_start--;}
            i_start-=2;            
        }
    }
    
    if(abs(j_start-j_end)%2==1){cout<<"Impossible";return;}
    
    while(j_start!=j_end){
            if(j_start<j_end) {j_start+=2;v.push_back("R");}
            else {v.push_back("L");j_start-=2;}
    }
    cout<<v.size()<<endl;
    sort(v.begin(),v.end());
    reverse(v.begin(),v.end());
    for(int i=0;i<v.size();i++){
        cout<<v[i]<<" ";
    }
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}