#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int a, int b, int c, int d) {
    int count=0;
    vector<string>s;
    while(a!=c || b!=d)
    {
        if(c<=a && d<=b)
        {
            if(c<a)
            {
                b-=1;
                a-=2;
                s.push_back("UL");
                //cout<<"UL\n";
            }
            else
            {
                b-=2;
                s.push_back("L");
                //cout<<"L\n";
            }
            count++;
        }
        else if(c>=a && d<=b)
        {
            if(c>a)
            {
                b-=1;
                a+=2;
                s.push_back("LL");
                //cout<<"LL\n";
            }
            else
            {
                b-=2;
                s.push_back("L");
                //cout<<"L\n";
            }
            count++;
        }
        else if(c<=a && d>=b)
        {
            if(c<a)
            {
                b+=1;
                a-=2;
                s.push_back("UR");
                //cout<<"UR\n";
            }
            else
            {
                b+=2;
                s.push_back("R");
                //cout<<"R\n";
            }
            count++;
        }
        else if(c>=a && d<=b)
        {
            if(c>a)
            {
                b+=1;
                a+=2;
                s.push_back("LR");
                //cout<<"LR\n";
            }
            else
            {
                b+=2;
                s.push_back("R");
                //cout<<"R\n";
            }
            count++;
        }
       // cout<<a<<b<<"\n";
        if(a>=n || b>=n || a<0 || b<0)
            break;
    }
    if(a==c && b==d)
    {
        cout<<count<<"\n";
        for(int i=0;i<s.size();i++)
            cout<<s[i]<<" ";
    }
    else
        cout<<"Impossible\n";
}

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