#include <bits/stdc++.h>

using namespace std;

void printShortestPath( int i_start, int j_start, int i_end, int j_end) {
    int q=0;
    string k;
    int x=j_start-j_end;
    int y=i_start-i_end;
    if(x==0)
    {
     while(y>2 || y<-2)
    {
         if(y>2)
         {
             x--;
             y-=2;
             k.append("UL ");
         }
         if(y<-2)
         {
            x++;
             y+=2;
             k.append("LR ");
         }
        q++;
        
    }
    }
    while(x>=1 && y>=2)
    {
        q++;
        x--;
        y-=2;
        k.append("UL ");
    }
    while(x<=-1 && y>=2)
    {
        q++;
        x++;
        y-=2;
         k.append("UR ");
    }
    while(x<=-2 && y==0)
    {
        q++;
        x+=2;
     k.append("R ");
    }
    while(x<=-1 && y<=-2)
    {
        q++;
        x++;
        y+=2;
         k.append("LR ");
    }
    while(x>=1 && y<=-2)
    {
        q++;
        x--;
        y+=2;
         k.append("LL ");
    }
    while(x>=2 && y==0)
    {
        q++;
        x-=2;
         k.append("L ");
        
    } 
if(x==0 && y==0)
    cout<<q<<endl<<k;
else
    cout<<"Impossible";
    
    
}

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(i_start, j_start, i_end, j_end);
    return 0;
}