#include <bits/stdc++.h>

using namespace std;

int util(int n,int startx,int starty,int endx,int endy){
	cout<<"startx "<<startx<<" starty "<<starty<<" endx "<<endx<<" endy "<<endy<<endl;
	//	cout<<"endx<startx  && starty>endy+1  "<<(endx<startx  && starty>endy+1)<<endl;
	
	if(endx+1<startx  &&  startx-2>=0 && starty-1>=0 && starty>endy ){
		cout<<"upperleft"<<endl;
		return 1+util(n,startx-2,starty-1,endx,endy);
	}

	if(endx+1<startx && starty+1<n && startx-2>=0 && starty<endy){
		cout<<"upperright"<<endl;
		return 1+util(n,startx-2,starty+1,endx,endy);
	}
	if(startx==endx && endy+1<starty){
		if(starty>=0){
			cout<<"left"<<endl;
			return 1+util(n,startx,starty-2,endx,endy);
		}
	}	
				
	if(startx+1< endx  && startx+2<n && starty+1<n && starty<=endy){
		cout<<"leftright"<<endl;
		return 1+util(n,startx+2 , starty+1 ,endx,endy);
	}
	if(startx+1< endx && starty-1>=0 && startx+2<n && starty>=endy){
		cout<<"leftleft"<<endl;
		return 1+util(n,startx+2,starty-1,endx,endy);
	}

	if(startx==endx && endy<starty){
		if(starty+2<n){
			cout<<"right"<<endl;
			return 1+util(n,startx,starty+2,endx,endy);
		}	
			
	}
	return 0;	
}
void utils(int n,int startx,int starty,int endx,int endy){
	//cout<<"startx "<<startx<<" starty "<<starty<<" endx "<<endx<<" endy "<<endy<<endl;
	//	cout<<"endx<startx  && starty>endy+1  "<<(endx<startx  && starty>endy+1)<<endl;
	
	if(endx+1<startx  &&  startx-2>=0 && starty-1>=0 && starty>endy ){
		cout<<"UL ";
		return utils(n,startx-2,starty-1,endx,endy);
	}

	if(endx+1<startx && starty+1<n && startx-2>=0 && starty<endy){
		cout<<"UR ";
		return utils(n,startx-2,starty+1,endx,endy);
	}
	if(startx==endx && endy+1<starty){
		if(starty>=0){
			cout<<"L ";
			return utils(n,startx,starty-2,endx,endy);
		}
	}	
				
	if(startx+1< endx  && startx+2<n && starty+1<n && starty<=endy){
		cout<<"LR ";
		return utils(n,startx+2 , starty+1 ,endx,endy);
	}
	if(startx+1< endx && starty-1>=0 && startx+2<n && starty>=endy){
		cout<<"LL ";
		return utils(n,startx+2,starty-1,endx,endy);
	}

	if(startx==endx && endy<starty){
		if(starty+2<n){
			cout<<"R ";
			return utils(n,startx,starty+2,endx,endy);
		}	
			
	}
	return ;	
}
int utilt(int n,int startx,int starty,int endx,int endy){
	//cout<<"startx "<<startx<<" starty "<<starty<<" endx "<<endx<<" endy "<<endy<<endl;
	//	cout<<"endx<startx  && starty>endy+1  "<<(endx<startx  && starty>endy+1)<<endl;
	
	if(endx+1<startx  &&  startx-2>=0 && starty-1>=0 && starty>endy ){
		//cout<<"upperleft"<<endl;
		return 1+utilt(n,startx-2,starty-1,endx,endy);
	}

	if(endx+1<startx && starty+1<n && startx-2>=0 && starty<endy){
		//cout<<"upperright"<<endl;
		return 1+utilt(n,startx-2,starty+1,endx,endy);
	}
	if(startx==endx && endy+1<starty){
		if(starty>=0){
			//cout<<"left"<<endl;
			return 1+utilt(n,startx,starty-2,endx,endy);
		}
	}	
				
	if(startx+1< endx  && startx+2<n && starty+1<n && starty<=endy){
		//cout<<"leftright"<<endl;
		return 1+utilt(n,startx+2 , starty+1 ,endx,endy);
	}
	if(startx+1< endx && starty-1>=0 && startx+2<n && starty>=endy){
		//cout<<"leftleft"<<endl;
		return 1+utilt(n,startx+2,starty-1,endx,endy);
	}

	if(startx==endx && endy<starty){
		if(starty+2<n){
			//cout<<"right"<<endl;
			return 1+utilt(n,startx,starty+2,endx,endy);
		}	
			
	}
	return 0;	
}

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    // UL, UR, R, LR, LL, L.
    
 	int condition1=abs((i_end-i_start)%4!=0 && abs((j_end-j_start)%2==0 ));
 	int condition2=abs((i_end-i_start)%4!=2 && abs((j_end-j_start)%2==1 ));
	if(condition1|| condition2) {
		cout<<"Impossible\n";
		return ;
	}
	//	cout<<"output"<<endl;
	
	cout<<utilt(n,i_start,j_start,i_end,j_end)<<endl;
	utils(n,i_start,j_start,i_end,j_end);
	cout<<endl;
}

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