#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int si, int sj, int di, int dj) {
    //  Print the distance along with the sequence of moves.
    if((abs(si-di))%2!=0){cout<<"Impossible\n";return;}
     int i=0,j=0,ul=0,ur=0,ll=0,lr=0,r=0,l=0;
    vector<string> ans,ans2;
    if(si>di)
    while(si!=di){
        si-=2;
        if(sj>=dj){sj--;
                   ul++;
                  }
        else {sj++;
              ur++;
             }
    }
    else{
        while(si!=di){
        si+=2;
        if(sj>dj){sj--;
                   ll++;
                  }
        else {sj++;
              lr++;
             }
    }
    }
    
    if((abs(sj-dj))%2!=0){cout<<"Impossible\n";return;}
    
    while(sj!=dj){
        if(sj>dj)
        {
            l++;
            sj-=2;
        }else{
            r++;
            sj+=2;
        }
    }
    cout<<ul+ur+ll+lr+l+r<<endl;
   
   while(ul-->0)
       cout<<"UL ";
    while(ur-->0)
       cout<<"UR ";
    while(r-->0)
       cout<<"R ";
    while(lr-->0)
       cout<<"LR ";
    while(ll-->0)
       cout<<"LL ";
    while(l-->0)
       cout<<"L ";
    
}

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