#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int m1, int n1, int m2, int n2) {
    int d = 0;
    vector<string> v;
    while(m1!=m2)
    {
        if(m1<m2)
        {
            if(n1>n2)
            {
                v.push_back("LL");
                d++;
                m1 = m1 + 2;
                n1--;
            }
            else
            {
                if(n1<n2)
                {
                    v.push_back("LR");
                    d++;
                    m1 = m1 + 2;
                    n1++;
                }
            }
        }
        else
        {
            if(m1>m2)
            {
                if(n1>n2)
                {
                    v.push_back("UL");
                    d++;
                    m1 = m1 - 2;
                    n1--;
                }
                else
                {
                    if(n1<n2)
                    {
                        v.push_back("UR");
                        d++;
                        m1 = m1 - 2;
                        n1++;
                    }
                }   
            }
        }
        if(n1==n2 && abs(m1-m2)%4==0)
           break;
    }
    if(n1==n2)
    {
        if(m1>m2)
        {
            while(m1>m2)
            {
                d = d + 2;
                v.push_back("UL");
                v.push_back("UR");
                m1 = m1 - 4;
            }
        }
        else
        {
            if(m1<m2)
            {
                while(m1<m2)
                {
                    d = d + 2;
                    v.push_back("LR");
                    v.push_back("LL");
                    m1 = m1 + 4;
                }
            }
        }
    }
    if(m1==m2 && n1!=n2)
    {
        if(n1>n2)
        {
            while(n1>n2)
            {
                d++;
                n1 = n1 - 2;
                v.push_back("L");
            }
        }
        else
        {
            while(n1<n2)
            {
                d++;
                n1 = n1 + 2;
                v.push_back("R");
            }
        }
    }
    printf("%d\n",d);
    for(int i=0; i<(v.end()-v.begin()); i++)
    {
        cout<<v[i]<<" ";
    }
    printf("\n");
    v.clear();
    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;
    int m1 = i_start;
    int n1 = j_start;
    int m2 = i_end;
    int n2 = j_end;
    int flag = 0;
    int a = abs(m1-m2);
    int b = abs(n1-n2);
    if(a%4!=0 && b==0)
    {
        printf("Impossible\n");
        flag = 1;
    }
    else
    {
        if((a/2)%2==1 && b%2==0)
        {
            printf("Impossible\n");
            flag = 1;
        }
        else
        {
            if(a%2!=0)
            {
                printf("Impossible\n");
                flag = 1;
            }
            else
            {
                if((a/2)%2==0 && b%2==1)
                {
                    printf("Impossible\n");
                    flag = 1;
                }
                else
                {
                    printShortestPath(n, i_start, j_start, i_end, j_end);
                }
            }
        }
    }
    return 0;
}