#include <bits/stdc++.h>

using namespace std;
int flg=0;
int cnt=0;
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 flg=0;
    if(abs(i_start - i_end )%2==1)
    {
        cout<<"Impossible";
        return ;
    }
     if(i_start-i_end>=2 && j_start>0 && j_start-j_end>=0)//UL
    {
        if(i_start==i_end && j_start==j_end)
        {
           // cout<<cnt;
            return ;
        }
        cout<<"UL ";
        flg=1;
        cnt++;
        printShortestPath(n,i_start-2,j_start-1,i_end,j_end);
    }
    else if(i_start-i_end>=2 && j_start<n-1 && j_start-j_end<=0)//UR
    {
        if(i_start==i_end && j_start==j_end)
        {
            //cout<<cnt;
            return ;
        }
        cout<<"UR ";
        flg=1;
        cnt++;
        printShortestPath(n,i_start-2,j_start+1,i_end,j_end);
    }
     else if((j_end-j_start>0 && (j_end-j_start)%2==0 && i_start==i_end) || (i_end-i_start)%2==0 && (j_end-j_start)>1&&(j_end-j_start)%2==1)//R
    {
        if(i_start==i_end && j_start==j_end)
        {
            //cout<<cnt;
            return ;
    }
        cout<<"R ";
        flg=1;
        cnt++;
        printShortestPath(n,i_start,j_start+2,i_end,j_end);
    }
    else if(i_end-i_start>=2  && j_start<n-1 && j_end-j_start>=0)//LR
    {
        if(i_start==i_end && j_start==j_end)
        {
            //cout<<cnt;
            return ;
        }
        cout<<"LR ";
        flg=1;
        cnt++;
        printShortestPath(n,i_start+2,j_start+1,i_end,j_end);
        //cout<<"LR ";
    }
    else if(i_end-i_start>=2 && j_start>0 && j_start-j_end>=0)//LL
    {
        if(i_start==i_end && j_start==j_end)
        {
            //cout<<cnt;
            return ;
        } 
        cout<<"LL ";
        flg=1;
        cnt++;
        printShortestPath(n,i_start+2,j_start-1,i_end,j_end);
    }
  else if(( j_start-j_end>0 && (j_start-j_end)%2==0 && i_start==i_end) || (i_end-i_start)%2==0 && (j_start - j_end)>1 && (j_start-j_end)%2==1)//L
    {
        if(i_start==i_end && j_start==j_end)
        {
          //  cout<<cnt;
        return ;
        }
        cout<<"L ";
        flg=1;
        //cnt++;
        printShortestPath(n,i_start,j_start-2,i_end,j_end);
    }
   // else if(flg==1 && i_start!=i_end  && j_start!=j_end || flg==0)
       // cout<<"Impossible";
}
int Path(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    //int flg=0;
    /*if(abs(i_start - i_end )%2==1)
    {
        //cout<<"Impossible";
        return 0;
    }*/
    if(i_start-i_end>=2 && j_start>0 && j_start-j_end>=0)//UL
    {
        if(i_start==i_end && j_start==j_end)
        {
            //cout<<cnt;
            return 1;
        }
        //cout<<"UL ";
        flg=1;
        cnt++;
        Path(n,i_start-2,j_start-1,i_end,j_end);
    }
    else if(i_start-i_end>=2 && j_start<n-1 && j_start-j_end<=0)//UR
    {
        if(i_start==i_end && j_start==j_end)
        {
           // cout<<cnt;
            return 1;
        }
        //cout<<"UR ";
        flg=1;
        cnt++;
        Path(n,i_start-2,j_start+1,i_end,j_end);
    }
   else if((j_end-j_start>0 && (j_end-j_start)%2==0 && i_start==i_end) || (i_end-i_start)%2==0 && (j_end-j_start)>1&&(j_end-j_start)%2==1)//R
    {
        if(i_start==i_end && j_start==j_end)
        {
           // cout<<cnt;
            return 1;
    }
        //cout<<"R ";
        flg=1;
        cnt++;
       Path(n,i_start,j_start+2,i_end,j_end);
    }
   else if(i_end-i_start>=2  && j_start<n-1 && j_end-j_start>=0)//LR
    {
                if(i_start==i_end && j_start==j_end)
        {
            //cout<<cnt;
            return 1;
        }
        //cout<<"LR ";
        flg=1;
        cnt++;
        Path(n,i_start+2,j_start+1,i_end,j_end);
        //cout<<"LR ";
    }
     else if(i_end-i_start>=2 && j_start>0 && j_start-j_end>=0)//LL
    {
        if(i_start==i_end && j_start==j_end)
        {
            //cout<<cnt;
            return 1;
        } 
        //cout<<"LL ";
        flg=1;
        cnt++;
        Path(n,i_start+2,j_start-1,i_end,j_end);
    }
   else if(( j_start-j_end>0 && (j_start-j_end)%2==0 && i_start==i_end) || (i_end-i_start)%2==0 && (j_start - j_end)>1 && (j_start-j_end)%2==1)//L
    {
        if(i_start==i_end && j_start==j_end)
        {
           // cout<<cnt;
        return 1;
        }
        //cout<<"L ";
        flg=1;
        cnt++;
        Path(n,i_start,j_start-2,i_end,j_end);
    }
   else if(flg==1 && i_start!=i_end  && j_start!=j_end || flg==0)
   {
       cnt=0;
       return 0;
       //cnt=0;
   }
    return 1;
}
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;
    //cout<<"1"<<endl;
    if(Path(n, i_start, j_start, i_end, j_end))
    {
        if(cnt>0)
           cout<<cnt<<endl; 
    }
    //cout<<"1"<<endl;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}