#include <iostream>
#include <climits>
#include <cstring>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

typedef long long int ll;
#define MOD 1000000007

bool check(int sy,int sx,int dy,int dx)
{
    if(abs(sy-dy)%2)
        return true;
    
    if( (abs(sy-dy)%4==0 && abs(sx-dx)%2==0) || (abs(sy-dy)%4!=0 && abs(sx-dx)%2!=0) )
        return false;
    
    return true;
}

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

int main() 
{
    ios_base::sync_with_stdio(false);
    
    int n,sx,sy,dx,dy;
    cin>>n>>sx>>sy>>dx>>dy;
    
    if(check(sx,sy,dx,dy))
    {
        cout<<"Impossible";
    }
    else
    {
        vector<int> v;
        string s="";
        int cnt=0;
        while(sx!=dx || sy!=dy)
        {
            cnt++;
            if(dx<sx && dy<=sy)
            {
                s+="UL ";
                v.push_back(1);
                sx-=2;
                sy--;
            }
            else
            if(dx<sx && dy>sy)
            {
                s+="UR ";
                v.push_back(2);
                sx-=2;
                sy++;
            }
            else
            if(dx>sx && dy>=sy)
            {
                s+="LR ";
                v.push_back(4);
                sx+=2;
                sy++;
            }
            else
            if(dx>sx && dy<sy)
            {
                s+="LL ";
                v.push_back(5);
                sx+=2;
                sy--;
            }
            else
            if(dx==sx && dy<sy)
            {
                s+="L ";
                v.push_back(6);
                sy-=2;
            }
            else
            if(dx==sx && dy>sy)
            {
                s+="R ";
                v.push_back(3);
                sy+=2;
            }
        }
        
        cout<<cnt<<"\n";
        
        sort(v.begin(),v.end());
        
        for(int i=0;i<v.size();i++)
            cout<<ss[v[i]-1];
    }
    
	// your code goes here
	return 0;
}