#include <bits/stdc++.h>
#define mp make_pair
#define F first
#define S second
using namespace std;
string parent[201][201];
int level[201][201];
bool visit[201][201];
map<string,pair<int,int> > m1;
pair<string,pair<int,int> > m[]={ {"UL",{-2,-1}},{"UR",{-2,1}},{"R",{0,2}}, {"LR",{2,1}},
                                        {"LL",{2,-1}},{"L",{0,-2}} };
int printShortestPath( int n,int x, int y, int i_end, int j_end)
{
 queue<pair<int,int> > q;
 visit[x][y]=true;
 level[x][y]=0;
 parent[x][y]="start";
 q.push(mp(x,y));
 while(!q.empty())
 {
     pair<int,int> tem=q.front();
     x=tem.F,y=tem.S;
     q.pop();
     for(auto it:m)
     {
        
         int x0=x+it.S.F,y0=y+it.S.S;
         if(x0>=0&&x0<n&&y0>=0&&y0<n&&visit[x0][y0]==false)
         {
             q.push(mp(x0,y0));
             visit[x0][y0]=true;
             parent[x0][y0]=it.F;
             level[x0][y0]=level[x][y]+1;
         }
     }
     
 }
    if(visit[i_end][j_end]==true)
        return 1;
   return 0;
 
 
}

int main() {
    int n;
    cin >> n;
    memset(visit,false,sizeof(visit));
    m1["UL"]={-2,-1}; m1["UR"]={-2,1}; m1["LR"]={2,1};
    m1["LL"]={2,-1}; m1["L"]={0,-2}; m1["R"]={0,2};
   
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    if(printShortestPath(n,i_start, j_start, i_end, j_end))
    {
        cout<<level[i_end][j_end]<<endl;
         int x=i_end,y=j_end;
        vector<string> v;
        while(level[x][y]!=0)
        {
           v.push_back(parent[x][y]);
             int x0=x-m1[parent[x][y]].F,y0=y-m1[parent[x][y]].S;
            x=x0,y=y0;
        }
        int sz=v.size();
        for(int i=sz-1;i>=0;i--)
            cout<<v[i]<<" ";
    
        
        
    }
    else
        cout<<"Impossible";
        
    return 0;
}