#include<bits/stdc++.h>
using namespace std;

vector<pair<int,int> > cs;
vector<pair<int,int> > fs;
int n;
int a[250][250];
pair<int,int> sn;
pair<int,int> en;

int circle[12]={-2,-1,-2,1,0,2,2,1,2,-1,0,-2};


bool insqr(pair<int,int> node){
	if(node.first<0 || node.first>=n || node.second<0 || node.second >=n)
		return false;
	return true;
}

void func(pair<int,int> node,int path_val){
//	cout << node.first << " " << node.second << endl;
//	cout << path_val << endl;

	if(path_val >= a[node.first][node.second])
		return;
	if(!insqr(node))
		return;
	cs.push_back(node);
	a[node.first][node.second] = path_val;
	if(node == en){
	//	cout << "in"<<endl;
	//	cout << "cs ka size" << cs.size() <<endl;
		fs.clear();
		for(int i=0;i<cs.size();i++)
			fs.push_back(cs[i]);
		cs.pop_back();
		return;
	}
	for(int i=0;i<12;i=i+2){
		pair<int,int> tmp;
		tmp.first = node.first + circle[i];
		tmp.second = node.second + circle[i+1];
		func(tmp,path_val+1);
	}
	cs.pop_back();
	return ;	
}

void print(){
	for(int i=0;i<fs.size();i++){
		cout << fs[i].first << " " << fs[i].second;
		cout <<endl;
	}
	return;
}

int main(){
	cin >>n;
	int x,y;
	cin >>x>>y;
	sn = make_pair(x,y);
	cin >>x>>y;
	en = make_pair(x,y);

	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			a[i][j] = INT_MAX;
		}
	}
//	cout <<"before func"<<endl;
	func(sn,0);
//	cout <<"after func"<<endl;
//	print();
	if(fs.size() == 0)
		cout <<"Impossible"<<endl;
	else{
		string s="";
		for(int i=0;i<fs.size()-1;i++){
			pair<int,int> tmp1;
			pair<int,int>tmp2;
			tmp1=fs[i];
			tmp2=fs[i+1];
			for(int j=0;j<12;j=j+2){
				if(tmp1.first + circle[j] == tmp2.first and tmp1.second + circle[j+1] == tmp2.second){
					if(j==0)
						s+="UL";
					if(j==2)
						s+="UR";
					if(j==4)
						s+="R";
					if(j==6)
						s+="LR";
					if(j==8)
						s+="LL";
					if(j==10)
						s+="L";
				break;
				}
			}
			if(i<fs.size()-2)
				s+=" ";
			
		}
		cout << fs.size()-1 << endl;
		cout << s << endl;
	}
	return 0;
}