#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int j1, int i1, int j2, int i2) {
     int p=0,q=0;vector<int>v;
    string s[6]={"UL","LL","LR","UR","L","R"};
    while(1)
    {
    	if(i1>i2&&j1>j2)
    	{
    		i1--;j1=j1-2;v.push_back(0);
    	}
    	else if(i1>i2&&j1<j2)
    	{
    		i1--;j1=j1+2;v.push_back(1);
    	}
    	else if(i1<i2&&j1<j2)
    	{
    		i1++;j1=j1+2;v.push_back(2);
    	}
    	else if(i1<i2&&j1>j2)
    	{
    		i1++;j1=j1-2;v.push_back(3);
    	}
    	else if(j1==j2)
    	{
    		if((i1-i2)==2)
    			{
    				i1=i1-2;v.push_back(4);
    			}
    		else if((i2-i1)==2)
    			{
    				i2=i2-2;v.push_back(5);
    			}
    		else if(i1==i2)
    		{
    			break;
    		}
    	}
        else if(i1==i2)
        {
           if((abs(j1-j2))%4==0)
            {
                cout<<abs((j1-j2)/2)<<endl;
                if(j1>j2)
                {
                     for(int o=0;o<(j1-j2)/2;o++)
                     {
                        if(o%2==0)
                            cout<<"UR ";
                        else
                            cout<<"UL ";
                     }
                }
                else
                {
                   for(int o=0;o<(j2-j1)/2;o++)
                     {
                        if(o%2==0)
                            cout<<"LR ";
                        else
                            cout<<"LL ";
                     }
                }
                q=1;
               break;
            }
            else
                {
                 p=1;break;
                    cout<<"Impossible";
                    exit(0);
                }
        }
         
    }
    if(p==1)
    	cout<<"Impossible";
    else if(q==0)
    {
    	cout<<v.size()<<endl;
    	for(auto it=v.begin();it!=v.end();it++)
    		cout<<s[*it]<<" ";
    }
    //return;
}

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;
}