#include<bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define ull unsigned long long
    #define ld long long
    #define pi pair<ll,ll>
    #define pii vector<pair<ll,ll> >
    #define v vector
    #define vi vector<ll>
    #define f(a,i,n) for(int i=a;i<n;i++)
    #define pb push
    #define mp make_pair
    #define MOD 1000000007
    #define MAX 1000001
    #define all(x) x.begin(),x.end()
    const ll inf=(ll) 1e18;
     
    ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
    ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
    ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
    int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
    ll spf[MAX+1];
      void sieve()//complexity = approx 3*10^6
        {
            f(1,i,MAX) {spf[i]=i;} 
            for(ll i=2;i<MAX;i+=2){spf[i]=2;}
            for(ll i=3;i<MAX;i+=2)
            {
                if(spf[i]==i) //if i is prime mark its multiples with spf as i
                {
                    for(ll j=i*i;j<MAX;j+=i)
                    {
                        spf[j]=min(i,(ll)spf[j]);
                    }
                }
            }
        }
     ll n;
     ll i1,jg,i2,j2,d;
     v< v<bool> >vis;
     pii ans;
     ll flag;
   	 
    bool isvalid(ll i11,ll j11)
    {
    	bool v1=(i11<n and j11<n and i11>-1 and j11>-1);
    	if(v1) return(!vis[i11][j11]);
    	else return false;
    }
    bool isvalid2(ll i11,ll j11,v<v<bool> >vis2)
    {
    	bool v2=(i11<n and j11<n and i11>-1 and j11>-1);
    	if(v2) return(!vis2[i11][j11]);
    	else return false;
    }
    void bfs()
    {
    	queue<pair<pi,ll > >q;
    	q.pb(mp(mp(i1,jg),(ll)0));
    	vis=v< v<bool> >(n,v<bool>(n,false));
    	d=MOD;
    	while(!q.empty())
    	{
    		pair<pi,ll> tt=q.front();
    		q.pop();
    		ll it=tt.first.first;
    		ll jt=tt.first.second;
    		vis[it][jt]=true;
    		//cout<<it<<" "<<jt<<" "<<endl;
    		if(it==i2 and jt==j2) d=min(d,tt.second);
    		if(isvalid(it-1,jt+2)) {q.pb(mp(mp(it-1,jt+2),tt.second+1));vis[it-1][jt+2]=true;}
    		if(isvalid(it+1,jt+2)) {q.pb(mp(mp(it+1,jt+2),tt.second+1));vis[it+1][jt+2]=true;}
    		if(isvalid(it-1,jt-2)) {q.pb(mp(mp(it-1,jt-2),tt.second+1));vis[it-1][jt-2]=true;}
    		if(isvalid(it+1,jt-2)) {q.pb(mp(mp(it+1,jt-2),tt.second+1));vis[it+1][jt-2]=true;}
    		if(isvalid(it-2,jt)) {q.pb(mp(mp(it-2,jt),tt.second+1));vis[it-2][jt]=true;}
    		if(isvalid(it+2,jt)) {q.pb(mp(mp(it+2,jt),tt.second+1));vis[it+2][jt]=true;}
    	}
    }
    
    void dfs(ll i11,ll j11,ll dis,v<v<bool> >vis2)
    {
    	if(flag) return;
    	//cout<<i11<<" "<<j11<<endl;
    	vis2[i11][j11]=true;
    	if(i11==i2 and j11==j2 and dis==d)
    	{
    		flag=1;
    		ans.push_back(mp(i11,j11));
    		return;
    	}
    	if(isvalid2(i11-1,j11+2,vis2) and !flag) {dfs(i11-1,j11+2,dis+1,vis2);} 
    	if(isvalid2(i11+1,j11+2,vis2) and !flag) {dfs(i11+1,j11+2,dis+1,vis2);}
    	if(isvalid2(i11-1,j11-2,vis2) and !flag) {dfs(i11-1,j11-2,dis+1,vis2);}
    	if(isvalid2(i11+1,j11-2,vis2) and !flag) {dfs(i11+1,j11-2,dis+1,vis2);}
    	if(isvalid2(i11-2,j11,vis2)   and !flag) {dfs(i11-2,j11,dis+1,vis2);}
    	if(isvalid2(i11+2,j11,vis2)   and !flag) {dfs(i11+2,j11,dis+1,vis2);} 

    	if(flag) ans.push_back(mp(i11,j11));
    }
    void init(v<v<bool> > & vis2)
    {
    	pii dummy;
    	ans=dummy;
    	vis2=v<v<bool> >(n,v<bool>(n,false));
    }
    int main()
    {
    	cin>>n;
    	cin>>i1>>jg>>i2>>j2;
    	swap(i1,jg);swap(i2,j2);
    	bfs();
    	if(d==MOD)
    	{
    		cout<<"Impossible\n";
    		return 0;
    	}
    	v<v<bool> >vis2;
    	cout<<d<<endl;
    	flag=0;
    	init(vis2);
    	if(!flag) if(isvalid2(i1-1,jg+2,vis2) and !flag) {dfs(i1-1,jg+2,1,vis2);}
    	if(!flag) init(vis2);
    	if(!flag) if(isvalid2(i1+1,jg+2,vis2) and !flag) {dfs(i1-1,jg+2,1,vis2);}
    	if(!flag) init(vis2);
    	if(!flag) if(isvalid2(i1+2,jg,vis2) and !flag) {dfs(i1+2,jg,1,vis2);}
    	if(!flag) init(vis2);
    	if(!flag) if(isvalid2(i1+1,jg-2,vis2) and !flag) {dfs(i1+1,jg-2,1,vis2);}
    	if(!flag) init(vis2);
    	if(!flag) if(isvalid2(i1-1,jg-2,vis2) and !flag) {dfs(i1-1,jg-2,1,vis2);}
    	if(!flag) init(vis2);
    	if(!flag) if(isvalid2(i1-2,jg,vis2) and !flag) {dfs(i1-2,jg,1,vis2);}
    	if(!flag) init(vis2);


    	if(ans.size()!=0)
    	{
    		ans.push_back(mp(i1,jg));
    		//cout<<i1<<" "<<jg<<endl;
    		for(ll i=ans.size()-2;i>-1;i--)
    		{
    			i1=ans[i+1].first;
    			jg=ans[i+1].second;
    			//cout<<i1<<" "<<jg<<" "<<ans[i].first<<" "<<ans[i].second<<" ";
    			if(ans[i].first==i1-1 and ans[i].second==jg+2) cout<<"LR ";
    			if(ans[i].first==i1+1 and ans[i].second==jg+2) cout<<"LL ";
    			if(ans[i].first==i1+2 and ans[i].second==jg) cout<<"R ";
    			if(ans[i].first==i1+1 and ans[i].second==jg-2) cout<<"UR ";
    			if(ans[i].first==i1-1 and ans[i].second==jg-2) cout<<"UL ";
    			if(ans[i].first==i1-2 and ans[i].second==jg) cout<<"L ";
  //  			cout<<endl;
    		}
    		cout<<endl;
    	}
    }