#include <bits/stdc++.h>

using namespace std;

void printShortestPath(long long int n, long long int i_start, long long int j_start, long long int i_end, long long int j_end) {
    //  Print the distance along with the sequence of moves.
    if((abs(i_start-i_end)%2==1) || (i_start==i_end && abs(j_start-j_end)%2==1)){
        cout<<"Impossible";
        return;
    }
    
    long long int c=0;
    queue< pair< pair<long long int,long long int>,long long int > > q;
    q.push(make_pair(make_pair(i_start,j_start),c));
    long long int vis[n][n];
    for(long long int i=0;i<n;i++)
	for(long long int j=0;j<n;j++)
		vis[i][j]=0;
    long long int prev[n][n];
    	
    while(!q.empty()){
        pair<long long int,long long int> f = (q.front().first);
	c = q.front().second;        
        long long int x = f.first;
        long long int y = f.second;
	vis[x][y]=1;
	if(x==i_end && y==j_end){
		cout<<c<<'\n';
		break;
	}
	q.pop();
        if(x-2>=0 && y-1>=0 && !vis[x-2][y-1]){
            prev[x-2][y-1] = 1;
            vis[x-2][y-1] = 1;
            q.push(make_pair(make_pair(x-2,y-1),c+1));
		if(x-2 == i_end && y-1 == j_end){
			c=c+1;	
			cout<<c<<'\n';
			break;
		}
        }
        if(x-2>=0 && y+1<n && !vis[x-2][y+1]){
            prev[x-2][y+1] = 2;
            vis[x-2][y+1] = 1;
            q.push(make_pair(make_pair(x-2,y+1),c+1));
		if(x-2 == i_end && y+1 == j_end){
		c=c+1;		
		cout<<c<<'\n';
			break;
		}
        }
        if(x>=0 && y+2<n && !vis[x][y+2]){
            prev[x][y+2] = 3;
            vis[x][y+2] = 1;
            q.push(make_pair(make_pair(x,y+2),c+1));
		if(x == i_end && y+2 == j_end){
	c=c+1;		
	cout<<c<<'\n';
			break;
		}
        }
        if(x+2<n && y+1<n && !vis[x+2][y+1]){
            prev[x+2][y+1] = 4;
            vis[x+2][y+1] = 1;
            q.push(make_pair(make_pair(x+2,y+1),c+1));
		if(x+2 == i_end && y+1 == j_end){
	c=c+1;	
		cout<<c<<'\n';
			break;
		}
        }
        if(x+2<n && y-1>=0 && !vis[x+2][y-1]){
            prev[x+2][y-1] = 5;
            vis[x+2][y-1] = 1;
            q.push(make_pair(make_pair(x+2,y-1),c+1));
		if(x+2 == i_end && y-1 == j_end){
	c=c+1;	
		cout<<c<<'\n';
			break;
		}
        }
        if(x>=0 && y-2>=0 && !vis[x][y-2]){
            prev[x][y-2] = 6;
            vis[x][y-2] = 1;
            q.push(make_pair(make_pair(x,y-2),c+1));
		if(x == i_end && y-2 == j_end){
	c=c+1;
				cout<<c<<'\n';
			break;
		}
        }
           
    }
	if(q.empty())
	{
		cout<<"Impossible";
		return;
	}
	vector<long long int>ans;
	long long int x=i_end;
	long long int y=j_end;
    for(long long int i=0;i<c;i++){
	if(prev[x][y]==1){
		ans.push_back(1);
		x=x+2;
		y=y+1;
	}
	else if(prev[x][y]==2){
		ans.push_back(2);
		x=x+2;
		y=y-1;
	}		
	else if(prev[x][y]==3){
		ans.push_back(3);
		y=y-2;
	}		
	else if(prev[x][y]==4){
		ans.push_back(4);
		x=x-2;
		y=y-1;
	}		
	else if(prev[x][y]==5){
		ans.push_back(5);
		x=x-2;
		y=y+1;
	}		
	else if(prev[x][y]==6){
		ans.push_back(6);
		y=y+2;
	}		
    }
    for(long long int i=c-1;i>=0;i--){
		if(ans[i]==1)
			cout<<"UL ";
		else if(ans[i]==2)
			cout<<"UR ";
		else if(ans[i]==3)
			cout<<"R ";
		else if(ans[i]==4)
			cout<<"LR ";
		else if(ans[i]==5)
			cout<<"LL ";
		else if(ans[i]==6)
			cout<<"L ";
	}		
      return; 
    
}

int main() {
    long long int n;
    cin >> n;
    long long int i_start;
    long long int j_start;
    long long int i_end;
    long long int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}