#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.
}

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;
    
    if(i_start==i_end &&  j_start==j_end)
        cout<<"0\n";
    else if(i_start==i_end && j_start!=j_end)
    {
        int diff = j_start-j_end;
        if(!(diff&1))
        {
            if(diff<0)
            {
                cout<<abs(diff)/2<<endl;
                for(int i=0 ; i<abs(diff)/2 ; ++i)
                    cout<<"R ";
                cout<<endl;
            }
            else
            {
                cout<<abs(diff)/2<<endl;
                for(int i=0 ; i<abs(diff)/2 ; ++i)
                    cout<<"L ";
                cout<<endl;
            }
        }
        else
            cout<<"Impossible\n";
    }
    else if(j_start==j_end && i_start!=i_end)
    {
        int diff = i_start-i_end;
        if(diff%4==0)
        {
            if(diff<0)
            {
                cout<<abs(diff)/2<<endl;
                for(int i=0 ; i<abs(diff)/2 ; i+=2)
                    cout<<"LR ";
                for(int i=0 ; i<abs(diff)/2 ; i+=2)
                    cout<<"LL ";
                cout<<endl;
            }
            else
            {
                cout<<abs(diff)/2<<endl;
                for(int i=0 ; i<abs(diff)/2 ; i+=2)
                    cout<<"UL ";
                for(int i=0 ; i<abs(diff)/2 ; i+=2)
                    cout<<"UR ";
                cout<<endl;
            }
        }
        else
            cout<<"Impossible\n";
    }
    else
    {
        int i_diff = i_end - i_start;
        int j_diff = j_end - j_start;
       /* if(i_start>i_end && j_start>j_end)
        {
            int i_min=0,j_min=0;
            while(true)
            {
                
            }
        }*/
        cout<<"Impossible\n"; 
    }
  //  printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}