#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define ss second
#define ff first
using namespace std;

map<pair<int,int>,int> mark;;
map<pair<int,int>,pair<int,int> > parent;

bool possible;
long int dp[502][502];

int dx[] ={-2,-2,0,2,2,0};
int dy[] = {-1,1,2,1,-1,-2};

string dir[] = {"UL","UR","R","LR","LL","L"};


int solve(int a,int b,int x,int y,int n,vector<string> &vec)
{
	
	int siz,level=0;
    
   queue<pair<int,int> > q;
   
   q.push(mp(a,b));
   siz = q.size();
   
   mark[mp(a,b)]=1;
   
   while(!q.empty())
   {
   	 pair<int,int> u = q.front();
   	 
   	 if(u.ff==x && u.ss==y)
   	 {
	  possible=1;
   	 //return level;
    }
   	 
   	 q.pop();
   	 siz--;
   	 
   	   for(int i=0;i<6;i++)
   	   {
   	   	  int p= u.ff + dx[i];
   	   	  int r= u.ss + dy[i];
   	   	  
	   	   	  if(p>=0 && r>=0 && p<n && r<n && mark[mp(p,r)]==0)
	   	   	  {
	   	   	  	  //cout<<"p="<<p<<" r="<<r<<" parx="<<u.ff<<"  pary="<<u.ss<<"\n";
	   	   	  	  q.push(mp(p,r));
	   	   	  	  mark[mp(p,r)]=1;
	   	   	  	  parent[mp(p,r)]=mp(u.ff,u.ss);
				}
		  }
		  
		  if(possible)
		  return level;
		  
		  if(siz==0)
		  {
		  siz = q.size();
		  level++;
	      }
   }
   
   return -1;
    
}


int main() {
    int a,b,x,y,i,n,p,q,u,v;
    
    vector<string> vec;
    vec.clear();
    parent.clear();
    
    cin>>n;
    
    cin>>a>>b>>x>>y;
    
    possible=0;
    
    int ans = solve(a,b,x,y,n,vec);
    
    //cout<<parent[mp(x,y)].ff<<" "<<parent[mp(x,y)].ss<<"\n";
    
    if(ans!=-1)
    {
    cout<<ans<<"\n";
    
    while(1)
    {
    	pair<int,int> par = parent[mp(x,y)];
    	p=par.ff;
    	q=par.ss;
    	
    	//cout<<"p="<<p<<" q="<<q<<" x="<<x<<"  y="<<y<<"\n";
    	
    	for(i=0;i<6;i++)
    	{
    		u=x+dx[i];
    		v=y+dy[i];
    		
    		if(u==p && v==q)
    		{
    			string str = dir[i];
    			if(str=="UL")
    			str="LR";
    			else if(str=="UR")
    			str="LL";
    			else if(str=="LR")
    			str="UL";
    			else if(str=="LL")
    			str="UR";
    			else if(str=="R")
    			str="L";
    			else if(str=="L")
    			str="R";
    			
    			x=p;
    			y=q;
    			
    			vec.pb(str);
    			break;
			}
		}
		
		if(p==a && q==b)
		break;
    	
	}
	
	reverse(vec.begin(),vec.end());
	
	for(i=0;i<vec.size();i++)
	cout<<vec[i]<<" ";
    
    
    }
    else
    cout<<"Impossible";
    
    return 0;
}