#include<iostream>
#include<list>
#include<stack>
#include<vector>
#include<queue>
using namespace std;

struct rcPos{
    int r, c;
    rcPos(){
        r=-1;
        c=-1;
    }
    rcPos(int i,int j){
        r=i;
        c=j;
    }
};

bool isFound(int r,int c,int n){
    return (r>=0 && c>=0 && r<n && c<n);
}

void pathF(vector<vector<rcPos>>&parent,vector<rcPos>&path,int r,int c){
    if(parent[r][c].r!=-1){
        pathF(parent,path,parent[r][c].r,parent[r][c].c);
    }
    path.push_back(rcPos(r,c));
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    cin>>n;
    vector<vector<bool>>visited(n,vector<bool>(n,false));
    vector<vector<rcPos>>parent(n,vector<rcPos>(n));
    vector<vector<int>>distance(n,vector<int>(n,-1));
    int sr,sc,fr,fc;
    cin>>sr>>sc>>fr>>fc;
    distance[sr][sc]=0;
    visited[sr][sc]=true;
    parent[sr][sc]=rcPos(-1,-1);
    queue<rcPos>q;
    q.push(rcPos(sr,sc));
    while(!q.empty()){
        int r,c,rr,cc;
        r=q.front().r;
        c=q.front().c;
        
        q.pop();
        rr=r-2;cc=c-1;
        if(isFound(rr,cc,n) && !visited[rr][cc]){
            visited[rr][cc]=true;
            parent[rr][cc]=rcPos(r,c);
            distance[rr][cc]=1+distance[r][c];
            q.push(rcPos(rr,cc));
        }
        
        rr=r-2;cc=c+1;
        if(isFound(rr,cc,n) && !visited[rr][cc]){
            visited[rr][cc]=true;
            parent[rr][cc]=rcPos(r,c);
            distance[rr][cc]=1+distance[r][c];
            q.push(rcPos(rr,cc));
        }
        
        rr=r;cc=c+2;
        if(isFound(rr,cc,n) && !visited[rr][cc]){
            visited[rr][cc]=true;
            parent[rr][cc]=rcPos(r,c);
            distance[rr][cc]=1+distance[r][c];
            q.push(rcPos(rr,cc));
        }
        
        rr=r+2;cc=c+1;
        if(isFound(rr,cc,n) && !visited[rr][cc]){
            visited[rr][cc]=true;
            parent[rr][cc]=rcPos(r,c);
            distance[rr][cc]=1+distance[r][c];
            q.push(rcPos(rr,cc));
        }
        
        rr=r+2;cc=c-1;
        if(isFound(rr,cc,n) && !visited[rr][cc]){
            visited[rr][cc]=true;
            parent[rr][cc]=rcPos(r,c);
            distance[rr][cc]=1+distance[r][c];
            q.push(rcPos(rr,cc));
        }
        
        rr=r;cc=c-2;
        if(isFound(rr,cc,n) && !visited[rr][cc]){
            visited[rr][cc]=true;
            parent[rr][cc]=rcPos(r,c);
            distance[rr][cc]=1+distance[r][c];
            q.push(rcPos(rr,cc));
        }
        
    }
    //cout<<parent[sr][sc].r<<endl;
    if(distance[fr][fc]==-1){
    	cout<<"Impossible"<<endl;
	}
	else{
		vector<rcPos>path;
	    pathF(parent,path,fr,fc);
	    cout<<distance[fr][fc]<<endl;
	    for(int i=1;i<path.size();i++){
	    	int dx=path[i].r-path[i-1].r;
	    	int dy=path[i].c-path[i-1].c;
	    	if(dx==-2 && dy==-1){
	    		cout<<"UL"<<" ";
			}
			if(dx==-2 && dy==1){
	    		cout<<"UR"<<" ";
			}
			if(dx==0 && dy==2){
	    		cout<<"R"<<" ";
			}
			if(dx==2 && dy==1){
	    		cout<<"LR"<<" ";
			}
			if(dx==2 && dy==-1){
	    		cout<<"LL"<<" ";
			}
			if(dx==0 && dy==-2){
	    		cout<<"L"<<" ";
			}
			
			
		}
	    
	}
    
    return 0;
}