#include <bits/stdc++.h>

using namespace std;

typedef int I;
typedef double D;
typedef long long int LL;
typedef long double LD;
typedef complex<D> CPX;
typedef pair<I,I> PII;
typedef pair<LL,LL> PLL;
typedef pair<D,LL> PDLL;
typedef pair<D,I> PDI;
typedef vector<I> VI;
typedef vector<LL> VLL;
typedef vector<D> VD;
typedef vector<LD> VLD;
typedef vector<CPX> VCPX;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<PDLL> VPDLL;
typedef vector<PDI> VPDI;
typedef pair<VI,VI> PVI;
typedef set<I> SI;
typedef set<LL> SLL;
typedef set<D> SD;
typedef set<LD> SLD;
typedef set<CPX> SCPX;
typedef set<PII> SPII;
typedef set<PLL> SPLL;
typedef set<PDLL> SPDLL;
typedef set<PDI> SPDI;

#define endl '\n'
#define fr first
#define sc second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define ins insert
#define ers erase
#define lb lower_bound
#define ub upper_bound
#define fd find
#define all(x) (x).begin(),(x).end()
#define srt(x) sort(all(x))
#define srtn(x,N) sort((x),(x)+(N))
#define lsrt(x,L) sort(all(x),(L))
#define lsrtn(x,N,L) sort((x),(x)+(N),(L))
#define sz(v) ((int)(v).size())
#define ifor(i,st,ed) for(int i=(st);i<=(ed);++i)
#define dfor(i,st,ed) for(int i=(st);i>=(ed);--i)
#define efor(it,x) for(auto it:(x))
#define cout(x) cout<<fixed<<setprecision(x)
#define pln1(a) cout<<(a)<<endl
#define pln2(a,b) cout<<(a)<<' '<<(b)<<endl
#define pln3(a,b,c) cout<<(a)<<' '<<(b)<<' '<<(c)<<endl
#define pln4(a,b,c,d) cout<<(a)<<' '<<(b)<<' '<<(c)<<' '<<(d)<<endl
#define ppln1(p,a) cout(p)<<(a)<<endl
#define ppln2(p,a,b) cout(p)<<(a)<<' '<<(b)<<endl
#define ppln3(p,a,b,c) cout(p)<<(a)<<' '<<(b)<<' '<<(c)<<endl
#define ppln4(p,a,b,c,d) cout(p)<<(a)<<' '<<(b)<<' '<<(c)<<' '<<(d)<<endl
#define debug(x) cerr<<#x<<" = "<<x<<endl

I g[500][500],n;
string from[500][500];
PII st,ed,pr[500][500];

PII moves[6] = {{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};
string mv[6] = {"UL", "UR", "R", "LR", "LL", "L"};
bool onboard(PII a)
{
	if(a==st)return 0;
	if(a.fr>=n||a.fr<0)return 0;
	if(a.sc>=n||a.sc<0)return 0;
	return 1;
}

void bfs()
{
	queue<PII> q;q.push(st);
	from[st.fr][st.sc]="*";
	while(!q.empty())
	{
		PII cn = q.front();q.pop();
		ifor(i,0,5)
		{
			PII nn = {cn.fr+moves[i].fr,cn.sc+moves[i].sc};
			if(onboard(nn)&&(!g[nn.fr][nn.sc]))
			{
				g[nn.fr][nn.sc] = g[cn.fr][cn.sc]+1;
				from[nn.fr][nn.sc] = mv[i];
				pr[nn.fr][nn.sc] = cn;
				q.push(nn);
			}
		}
	}
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n;
    cin>>st.fr>>st.sc>>ed.fr>>ed.sc;
    from[ed.fr][ed.sc] = "";
    bfs();
    if(from[ed.fr][ed.sc]=="")
		cout << "Impossible" << endl;
	else
	{
		vector<string> ans;
		while(ed!=st)
		{
			ans.eb(from[ed.fr][ed.sc]);
			ed = pr[ed.fr][ed.sc];
		}
		reverse(all(ans));
		cout << sz(ans) << endl;
		ifor(i,0,sz(ans)-1)
		cout << ans[i] << " \n"[i==sz(ans)-1];
	}
    
    return 0;
}