#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define NFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define pb push_back
#define ll long long
#define F first
#define PI 3.14159265358979323846264338327
#define S second
#define all(v) v.begin(),v.end()
#define trace(x) cout << '>' << #x << ':' << x << endl;
#define trace2(x,y) cout<< '>' << #x << ':' << x << " | " << #y << ':' << y << endl;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)
#define MOD 1000000007
using namespace std;
ll sx,sy,ex,ey;
ll dx[7]={0,-2,-2,0,2,2,0};
ll dy[7]={0,-1,1,2,1,-1,-2};
pair<ll,ll>parent[505][505];
ll dist[505][505];
ll visit[505][505];
int main()
{
    fast;
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ll t,n,m,x,y;
    cin>>n;
    cin>>sx>>sy>>ex>>ey;
    queue<pair<ll,ll> >q;
    q.push({sx,sy});
    visit[sx][sy]=1;
    while(!q.empty())
    {
    	pair<ll,ll>pp=q.front();
    	q.pop();
    	ll xx=pp.F;
    	ll yy=pp.S;
    	FOR(i,1,6)
    	{
    	   if(xx+dx[i]>=0&&xx+dx[i]<n&&yy+dy[i]>=0&&yy+dy[i]<n&&!visit[xx+dx[i]][yy+dy[i]])
    	   {
    	   	visit[xx+dx[i]][yy+dy[i]]=visit[xx][yy]+1;
    	   	q.push({xx+dx[i],yy+dy[i]});
    	   	parent[xx+dx[i]][yy+dy[i]].F=xx;
    	   	parent[xx+dx[i]][yy+dy[i]].S=yy;
    	   	
    
    	   }
    	}
    	if(visit[ex][ey])
    	break;
    }
	//return 0;
	if(!visit[ex][ey])
	{
		cout<<"Impossible\n";
	}
	else
	{
		cout<<(visit[ex][ey]-1)<<"\n";
		vector<string>ans;
		ll xxx=ex;
		ll yyy=ey;
		while(1)
		{
			//printf("%lld %lld\n",xxx,yyy);
			if(xxx==sx&&yyy==sy)
			break;
			ll gx=parent[xxx][yyy].F;
			ll gy=parent[xxx][yyy].S;
			if(gx==xxx)
			{
				if(gy==yyy+2)
				{
					ans.pb("L");
				}
				else
				{
					ans.pb("R");
				}
			}
			else if(gx==xxx-2)
			{
				if(gy==yyy-1)
				{
					ans.pb("LR");
				}
				else
				{
					ans.pb("LL");
				}
			}
			else
			{
				if(gy==yyy-1)
				{
					ans.pb("UR");
				}
				else
				{
					ans.pb("UL");
				}
			}
			xxx=gx;
			yyy=gy;
			
		}
		reverse(ans.begin(),ans.end());
		for(auto i:ans)
		cout<<i<<" ";
	}
    
    




return 0;
}