#include <bits/stdc++.h>

using namespace std;
int d[209][209];
int f[209][209];
int w[209][209];
string D[6]={"UL","UR","R","LR","LL","L"};
int dy[6]={-1,1,2,1,-1,-2};
int dx[6]={-2,-2,0,2,2,0};

bool ch(int x, int y, int n)
{
    if(x>=0 && x<n && y>=0 && y<n) return 1;
    return 0;
}
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
  queue<pair<int,int> > q;
    q.push({i_start,j_start});
   while(q.size())
   {
       
       pair<int,int> v=q.front(); q.pop();
       int x=v.first,y=v.second;
     //  cout<<x<<" " <<y<<" "<<x-dx[w[x][y]]<<" "<<y-dy[w[x][y]]<<endl;
       for (int i=0; i<6; i++)
           if(ch(x+dx[i],y+dy[i],n))
               if(f[x+dx[i]][y+dy[i]]==0)
               {
                   f[x+dx[i]][y+dy[i]]=1;
                   q.push({x+dx[i],y+dy[i]});
                   w[x+dx[i]][y+dy[i]]=i;
               }
   }
    if(f[i_end][j_end]==0) 
    {
        cout<<"Impossible"<<endl;
        return;
    }
    vector<string> V;
    int p=i_end,Q=j_end;
    while(p!=i_start || Q!=j_start)
    {
     V.push_back(D[w[p][Q]]);
        int c=dy[w[p][Q]];
        p-=dx[w[p][Q]];
        Q-=c;
    }
    cout<<V.size()<<endl;
    for (int i=0; i<V.size(); i++)
        cout<<V[V.size()-1-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;
}