#include <iostream>
#include<bits/stdc++.h>
using namespace std;
//FUCK.......MISSED AN EASY ONE ....SHITTT

#define ll long long
#define ll long long
#define N (ll)250
#define Z 70*N
#define M ((100000000LL*100000000LL)+61LL)
#define pi pair<ll,ll>
#define F first
#define S second
#define pb push_back
#define ld long double
#define inf (ll)1e9
#define pi2 pair<string,ll>
#define pii pair<pi,int>
#define bs 315
#define p1 10000000007
#define p2 998244353
//||

//"\n"
//UL, UR, R, LR, LL, L
int dx[]={-2,-2,0,2, 2, 0};
int dy[]={-1, 1,2,1,-1,-2};
map<int,string> mp;
int d[N][N],n;
pii par[N][N];
bool check(int x,int y)
{
    return (x>=0) && (x<n)&&(y>=0)&&(y<n);
}
void bfs(int x1,int y1)
{
    queue<pi> q;
    q.push({x1,y1});
    int i,j;
    for(i=0;i<N;i++)
        for(j=0;j<N;j++)
          d[i][j]=inf;
    d[x1][y1]=0;
    par[x1][y1]=make_pair(make_pair(-1,-1),-1);
    while(!q.empty())
    {
        pi z=q.front();
        q.pop();
        int j;
         for(j=0;j<6;j++)
   {
       int xx=z.F+dx[j];
       int yy=z.S+dy[j];
       if(check(xx,yy) && d[xx][yy]==inf)
       {
           q.push({xx,yy});
           d[xx][yy]=d[z.F][z.S]+1;
           par[xx][yy]=pii(pi(z.F,z.S),j);
       }
   }
    }

}
int main()
{
    int x1,y1,x2,y2;
    mp[0]="UL";
    mp[1]="UR";
    mp[2]="R";
    mp[3]="LR";
    mp[4]="LL";
    mp[5]="L";
	int i;
	cin>>n;

	cin>>x1>>y1>>x2>>y2;
	bfs(x1,y1);
	if(d[x2][y2]==inf)
    {
        cout<<"Impossible"<<endl;
    }
    else
    {
        int t1,t2;
        vector<int> v;
        while(par[x2][y2].S!=-1)
        {
            v.pb(par[x2][y2].S);
            t1=par[x2][y2].F.F;
            t2=par[x2][y2].F.S;
            x2=t1;
            y2=t2;
        }
        cout<<v.size()<<endl;
        for(i=v.size()-1;i>=0;i--)
            cout<<mp[v[i]]<<" ";
        cout<<endl;

    }
}