#include <bits/stdc++.h>

using namespace std;

/*
(i-2,j-1)
(i-2,j+1)
(i  ,j+2)
(i+2,j+1)
(i+2,j-1)
(i  ,j-2)
*/

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 distance=-1,chess[n][n],start,end,pos1,pos2,c=0,f=0;
    int i,j;
    char knight;
    string moves[10];
    start=chess[i_start][j_start]=1;
    end=chess[i_end][j_end]=9;
    pos1=i_start-i_end;
    pos2=j_start-j_end;
  //  cout<<"pos 1: "<<pos1<<endl<<"pos 2: "<<pos2<<endl;
    for(i=0; i<n; i++)
    {
        for(j=0; j<n; j++)
        {
            if((i==i_start && j==j_start) || (i==i_end && j==j_end))
                c=0;
            else
                chess[i][j]=0;
        }
    }
    i=i_start; j=j_start;
//  cout<<"Initially i is "<<i<<" and j is "<<j<<endl;
    if(j==j_end && i!=i_end)
    {
        while(i!=i_end)
        {
            f++;
            while(pos1<0)
            {
                i=i+2;
                j=j+1;
            //    cout<<"i is "<<i<<" and j is "<<j<<endl;
                distance++;
                moves[distance]="LR";
                pos1=i-i_end;
                pos2=j-j_end;
            //    cout<<"pos 1: "<<pos1<<endl<<"pos 2: "<<pos2<<endl;
                if(pos2==1)
                {
                    break;
                }
            }
            if(pos2==1)
            {
                while(pos1<0 && j!=j_end)
                {
                    i=i+2;
                    j=j-1;
                  //  cout<<"i is "<<i<<" and j is "<<j<<endl;
                    distance++;
                    moves[distance]="LL";
                    pos1=i-i_end;
                    pos2=j-j_end;
                  //  cout<<"pos 1: "<<pos1<<endl<<"pos 2: "<<pos2<<endl;
                }
            }
        }
        if(f>10)
        {
            cout<<"Impossible";
            exit(0);
        }
    }
    
    while(i!=i_end && j!=j_end)
    {
        c++;
        //cout<<"dd";
            while((pos1>0 && pos2>0) && i!=i_end)
            {
                i=i-2; j=j-1;
            //    cout<<"i is "<<i<<" and j is "<<j<<endl;
                distance++;
                moves[distance]="UL";
                pos1=i-i_end;
                pos2=j-j_end;
             //   cout<<"pos 1: "<<pos1<<endl<<"pos 2: "<<pos2<<endl;
            }
       
            while((pos2<0 && pos1>0) && i!=i_end)
            {
                i=i-2; j=j+1;
             //   cout<<"i is "<<i<<" and j is "<<j<<endl;
                distance++;
                moves[distance]="UR";
                pos1=i-i_end;
                    pos2=j-j_end;
          //      cout<<"pos 1: "<<pos1<<endl<<"pos 2: "<<pos2<<endl;
            }
        
            while((pos1<0 && j==j_end) && i!=i_end)
            {
                i=i+2; j=j+1;
                distance++;
            //    cout<<"i is "<<i<<" and j is "<<j<<endl;
                moves[distance]="LR";
                pos1=i-i_end;
                pos2=j-j_end;
             //   cout<<"pos 1: "<<pos1<<endl<<"pos 2: "<<pos2<<endl;
            }
            if(i==i_end && ((j-j_end==2)||(j-j_end==-2)))
            {
                //cout<<"ho";
                if(j-j_end==2)
                {
                    j=j-2;
                    distance++;
                //    cout<<"i is "<<i<<" and j is "<<j<<endl;
                    moves[distance]="L";
                    pos1=i-i_end;
                    pos2=j-j_end;
                //    cout<<"pos 1: "<<pos1<<endl<<"pos 2: "<<pos2<<endl;
                }
                if(j-j_end==-2)
                {
                    j=j+2;
                    distance++;
                 //   cout<<"i is "<<i<<" and j is "<<j<<endl;
                    moves[distance]="R";
                    pos1=i-i_end;
                    pos2=j-j_end;
                 //   cout<<"pos 1: "<<pos1<<endl<<"pos 2: "<<pos2<<endl;
                }
            }
        if(c>10)
        {
            cout<<"Impossible";
            exit(0);
        }
      //   cout<<"i is "<<i<<" and j is "<<j<<endl;
    }
    distance=distance+1;
   cout<<distance<<endl;
    for(i=0;i<=distance;i++)
    {
        cout<<moves[i]<<" ";
    }
    
}

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