#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    vector<string> path;
    while(i_start-2>=i_end&&j_start-1>=j_end+1){
        path.push_back("UL");
        if(i_start==i_end&&j_start==j_end)
        break;
        i_start-=2;
        j_start-=1;
        
    }
    
    while(i_start-2>=i_end&&j_start+1<=j_end+1){
        path.push_back("UR");
                if(i_start==i_end&&j_start==j_end)
            break;
        i_start-=2;
        j_start+=1;
        
    }
    while(i_start==i_end&&j_start+2<=j_end){
         path.push_back("R");
                if(i_start==i_end&&j_start==j_end)
            break;
        j_start+=2;
    }
    while((i_start+2<=i_end)&&(j_start+1<=j_end+1)){
       path.push_back("LR");
       if(i_start==i_end&&j_start==j_end)
            break;
        i_start+=2;
        j_start+=1;
        
    }
    while(i_start+2<=i_end&&j_start-1>=j_end-1){
        path.push_back("LL");
                if(i_start==i_end&&j_start==j_end)
            break;
        i_start+=2;
        j_start-=1;
    }
    while(i_start==i_end&&j_start-2>=j_end){
        path.push_back("L");
                if(i_start==i_end&&j_start==j_end)
            break;
        j_start-=2;
    }
    if(i_start==i_end&&j_start==j_end){
    cout<<path.size()<<endl;
    for(unsigned i=0;i<path.size();i++)
    {
        cout<<path[i]<<" ";
    }
    }
    else{
        cout<<"Impossible"<<endl;
   }
}

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;
}