#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> j_start >> i_start >> j_end >> i_end;
    int x = i_start,y = j_start,count = 0;
    bool flag = true;
    string path = "";
    while(flag)
    {
        flag = false;
        if(j_end < y)
        {
            if(i_end < x)
            {
                if(y-2 >= j_end) 
                {
                    y = y - 2;
                    x = x - 1;
                    path.append("UL ");
                    flag = true;
                    count++;
                }
                else 
                {
                    cout<<"Impossible";
                    break;
                }
            }
            else if(i_end > x)
            {
                if(y-2 >= j_end) 
                {
                    y = y - 2;
                    x = x + 1;
                    path.append("UR ");
                    flag = true;
                    count++;
                }
                else 
                {
                    cout<<"Impossible";
                    break;
                }
            }
            else if(i_end == x)
            {
                if(x-1>=0 && y-2>=j_end) 
                {
                    y = y-2;
                    x = x-1;
                    path.append("UL ");
                    flag = true;
                    count++;
                }
                else if(x+1<n && y-2>=j_end) 
                {
                    y = y-2;
                    x = x+1;
                    path.append("UR ");
                    flag = true;
                    count++;
                }
                else 
                {
                    cout<<"Impossible";
                    break;
                }
            }
        }
        else if(j_end > y)
        {
            if(i_end < x)
            {
                if(y+2 <= j_end) 
                {
                    y = y + 2;
                    x = x - 1;
                    path.append("LL ");
                    flag = true;
                    count++;
                }
                else 
                {
                    cout<<"Impossible";
                    break;
                }
            }
            else if(i_end > x)
            {
                if(y+2 <= j_end) 
                {
                    y = y + 2;
                    x = x + 1;
                    path.append("LR ");
                    flag = true;
                    count++;
                }
                else 
                {
                    cout<<"Impossible";
                    break;
                }
            }
            else if(i_end == x)
            {
                if(y+2 <= j_end) 
                {
                    y = y + 2;
                    x = x + 1;
                    path.append("LR ");
                    flag = true;
                    count++;
                }
                else if(y+2 <= j_end) 
                {
                    y = y + 2;
                    x = x - 1;
                    path.append("LL ");
                    flag = true;
                    count++;
                }
                else 
                {
                    cout<<"Impossible";
                    break;
                }
            }   
        }
        else
        {
            if(i_end > x)
            {
                if(x+2 < n)
                {
                    x = x+2;
                    path.append("R ");
                    flag = true;
                    count++;
                }
                else
                {
                    cout<<"Impossible";
                    break;
                }
            }
            else if(i_end < x)
            {
                if(x-2 >= 0)
                {
                    x = x-2;
                    path.append("L ");
                    flag = true;
                    count++;
                }
                else
                {
                    cout<<"Impossible";
                    break;
                }
            }
        }
        if(x==i_end && y==j_end)
        {
            cout<<count<<endl;
            cout<<path<<endl;
            flag = false;
        }
    }
    return 0;
}