#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    string s[6]={"UL","UR","R","LR","LL","L"};
    string kaam[200];
    int count=0,cnt=0,z=0;
    while(i_start!=i_end || j_start!=j_end){
    if(i_start-i_end>=2 && j_start-j_end>=1){
        i_start-=2; j_start-=1;
        count++;
        kaam[z]=s[0];
        z++;
    }
    else if(i_start-i_end>=2 && j_end-j_start>=1){
        i_start-=2; j_start+=1; count++;
        kaam[z]=s[1];
        z++;
    }
    else if(i_start-i_end>=2){
        i_start-=2; j_start-=1;
        count++;
        kaam[z]=s[0];
        z++;
    }
    else if(i_start-i_end>=2){
        i_start-=2; j_start+=1; count++;
        kaam[z]=s[1];
        z++;
    }    
    else if(j_end-j_start>=2){
        j_start+=2; count++;
        kaam[z]=s[2];
        z++;
    }
    else if(i_end-i_start>=2 && j_end-j_start>=1){
        i_start+=2; j_start+=1; count++;
        kaam[z]=s[3];
        z++;
    }
    else if(i_end-i_start>=2 && j_start-j_end>=1){
        i_start+=2; j_start-=1; count++;
        kaam[z]=s[4];
        z++;
    }
    else if(i_end-i_start>=2){
        i_start+=2; j_start+=1; count++;
        kaam[z]=s[3];
        z++;
    }
    else if(i_end-i_start>=2){
        i_start+=2; j_start-=1; count++;
        kaam[z]=s[4];
        z++;
    }
    else if(j_start-j_end>=2){
        j_start-=2; count++;
        kaam[z]=s[5];
        z++;
    }
    else{
        cnt++;
        break;
    }
    }
    
    if(cnt!=0){
        cout<<"Impossible";
    }
    else{
        cout<<count<<endl;
        for(int i=0;i<count;i++){
            cout<<kaam[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;
}