#include<bits/stdc++.h>

using namespace std;

queue<pair<int,int>> q;
int tim[301][301];
int  prevx[300][300],prevy[300][300];
vector<int> ans;
int n,m,pocetnox,pocetnoy,krajx, krajy;

int u_matrici(int x,int y)
{
    if (x<0 || y<0 || x>=n || y>=n) return 0;
    return 1;
}
void bfs(int pocetnox,int pocetnoy)
{
   q.push({pocetnox,pocetnoy});
   tim[pocetnox][pocetnoy]=0;

   while(!q.empty())
   {
      pair<int,int> trenutni=q.front();
      q.pop();
      int x=trenutni.first;
      int y=trenutni.second;
      //cout<<"TREENUTNA POZICIJA: "<<x<<" "<<y<<" PRETHODNI: "<<prevx[x][y]<<" "<<prevy[x][y]<<"\n";
      int vreme=tim[x][y];

        if (u_matrici(x-2,y+1) && tim[x-2][y+1]==-1)
      {
            tim[x-2][y+1]=vreme+1;
            q.push({x-2,y+1});
            prevx[x-2][y+1]=x;
            prevy[x-2][y+1]=y;
      }


      if (u_matrici(x-2,y-1) && tim[x-2][y-1]==-1)
      {
            tim[x-2][y-1]=vreme+1;
            q.push({x-2,y-1});
            prevx[x-2][y-1]=x;
            prevy[x-2][y-1]=y;
      }


      if (u_matrici(x,y+2) && tim[x][y+2]==-1)
      {
            tim[x][y+2]=vreme+1;
            q.push({x,y+2});
            prevx[x][y+2]=x;
            prevy[x][y+2]=y;
      }

       if (u_matrici(x+2,y+1) && tim[x+2][y+1]==-1)
      {
            tim[x+2][y+1]=vreme+1;
            q.push({x+2,y+1});
             prevx[x+2][y+1]=x;
            prevy[x+2][y+1]=y;
      }
      if (u_matrici(x+2,y-1) && tim[x+2][y-1]==-1)
      {
            tim[x+2][y-1]=vreme+1;
            q.push({x+2,y-1});
             prevx[x+2][y-1]=x;
             prevy[x+2][y-1]=y;
      }



        if (u_matrici(x,y-2) && tim[x][y-2]==-1)
      {
            tim[x][y-2]=vreme+1;
            q.push({x,y-2});
            prevx[x][y-2]=x;
            prevy[x][y-2]=y;
      }

   }

   return;
}
void calc(int x, int y, int x1, int y1)
{
    if (x==x1 && y==y1+2) ans.push_back(1);
    if (x==x1 && y==y1-2) ans.push_back(2);
    if (x==x1+2 && y==y1+1) ans.push_back(3);
    if (x==x1+2 && y==y1-1) ans.push_back(4);
    if (x==x1-2 && y==y1+1) ans.push_back(5);
    if (x==x1-2 && y==y1-1) ans.push_back(6);
}

void print(int x, int y)
{
    while(x!=pocetnox || y!=pocetnoy)
    {
        int x1=prevx[x][y];
        int y1=prevy[x][y];
        calc(x,y,x1,y1);
        x=x1;
        y=y1;
    }
}
int main()
{
    cin>>n; //dimenzije mattrice

    cin>>pocetnox>>pocetnoy;

    cin>>krajx>>krajy;
    for (int i=0;i<n;i++)
        for (int j=0;j<n;j++)
        tim[i][j]=-1;

    bfs(pocetnox,pocetnoy);



     if (tim[krajx][krajy]==-1)
     {
         cout<<"Impossible\n";
         return 0;
     }

    print(krajx,krajy);

    reverse(ans.begin(),ans.end());
    cout<<ans.size()<<"\n";

    for (int i:ans)
    {
        if (i==1) cout<<"R ";
        if (i==2) cout<<"L ";
        if (i==3) cout<<"LR ";
        if (i==4) cout<<"LL ";
        if (i==5) cout<<"UR ";
        if (i==6) cout<<"UL ";
    }

    return 0;
}

//pederi sto niste pisali checker - sat vremena gledam bug