// ayy
// ' lamo
// SUBLIME HAX
	#include <bits/stdc++.h>
	using namespace std;
	template<class T,class U>
	ostream &operator<<(ostream &os,const pair<T,U> &x) {
		return os<<"("<<x.first<<","<<x.second<<")";
	}
	namespace dbg_ns {
		template<typename C>
		struct is_iterable {
			template<class T> static long check(...);
			template<class T> static char check(int,
				typename T::const_iterator = C().end());
			enum {
				value = sizeof(check<C>(0)) == sizeof(char),
				neg_value = sizeof(check<C>(0)) != sizeof(char)
			};
		};
		template<class T> ostream &_out_str(ostream &os,const T &x) {
			return os<<'"'<<x<<'"';
		}
		template<class T> ostream &_dbg2_5(ostream &,const T &);
		template<bool B,typename T=void> using eit=typename enable_if<B,T>::type;
		template<class T>
		inline ostream &_dbg3(ostream &os,eit<is_iterable<T>::neg_value,const T> &x) {
			return os<<x;
		}
		template<class T>
		inline ostream &_dbg3(ostream &os,eit<is_iterable<T>::value,const T> &V) {
			os<<"{";
			bool ff=0;
			for(const auto &E:V) _dbg2_5(ff?os<<",":os,E), ff=1;
			return os<<"}";
		}
		template<>
		inline ostream &_dbg3<string>(ostream &os,const string &x) {
			return _out_str(os,x);
		}
		template<>
		inline ostream &_dbg3<const char *>(ostream &os,const char *const &x) {
			return _out_str(os,x);
		}
		template<class T> inline ostream &_dbg2_5(ostream &os,const T &x) {
			return _dbg3<T>(os,x);
		}
		template<class T,typename... Args> ostream &_dbg2(ostream &os,vector<string>::iterator nm,const T &x,Args&&... args);
		inline ostream &_dbg2(ostream &os,vector<string>::iterator) { return os; }
		template<typename... Args>
		inline ostream &_dbg2(ostream &os,vector<string>::iterator nm,const char *x,Args&&... args) {
			return _dbg2(_dbg3<const char *>(os<<"  ",x),nm+1,args...);
		}
		template<class T,typename... Args>
		inline ostream &_dbg2(ostream &os,vector<string>::iterator nm,const T &x,Args&&... args) {
			return _dbg2(_dbg3<T>(os<<"  "<<*nm<<"=",x),nm+1,args...);
		}
		vector<string> split(string s) {
			vector<string> Z;
			string z="";
			s+=',';
			int dep=0;
			for(char c:s) {
				if(c==',' && !dep) Z.push_back(z),z="";
				else z+=c;
				if(c=='(') ++dep;
				if(c==')') --dep;
			}
			return Z;
		}
		template<typename... Args> inline ostream &_dbg1(int ln,const string &nm,Args&&... args) {
			auto nms=split(nm);
			return _dbg2(cerr<<"L"<<ln<<":",nms.begin(),args...)<<endl;
		}
	}
	#define dbg(...) dbg_ns::_dbg1(__LINE__,#__VA_ARGS__,__VA_ARGS__)
	#define sz(x) (int(x.size()))
	#define eprintf(...) fprintf(stderr,__VA_ARGS__)
	#define fi first
	#define se second
	#define pb push_back
// END SUBLIME HAX
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld; //CARE
typedef complex<ld> pt;
const ld eps=(ld)1e-8;
const ld tau=2*(ld)acosl(-1);
const int inf=1e9+99;
const ll linf=1e18+99;
const int P=1e9+7;





const int N=202;
bool seen[N][N];
int dist[N][N];
pair<pair<int,int>,string> pr[N][N];
int n;

const int dx[]={-1,1,2,1,-1,-2};
const int dy[]={2,2,0,-2,-2,0};
const string ds[]={"UL","UR","R","LR","LL","L"};



int32_t main() {
	cin>>n;
	int x,y; cin>>x>>y;
	int _x,_y; cin>>_x>>_y;
	swap(x,y); swap(_x,_y);
	seen[x][y]=1;
	dist[x][y]=0;
	pr[x][y]={{-1,-1},""};
	vector<pair<int,int> > vv={{x,y}};
	for(int ii=0;ii<sz(vv);ii++) {
		tie(x,y)=vv[ii];
		// dbg(x,y);
		for(int k=0;k<6;k++) {
			int xx=x+dx[k];
			int yy=y-dy[k];
			if(xx<0 || yy<0 || xx>=n || yy>=n) continue;
			if(seen[xx][yy]) continue;
			seen[xx][yy]=1;
			dist[xx][yy]=dist[x][y]+1;
			pr[xx][yy]={{x,y},ds[k]};
			vv.pb({xx,yy});
		}
	}

	x=_x,y=_y;
	if(!seen[x][y]) return cout<<"Impossible"<<endl,0;
	vector<string> zz;
	for(;~pr[x][y].fi.fi;) zz.pb(pr[x][y].se), tie(x,y)=pr[x][y].fi;
	reverse(zz.begin(),zz.end());
	n=sz(zz);
	cout<<n<<endl;
	for(int i=0;i<n;i++) cout<<zz[i]<<" \n"[i==n-1];
}