#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.

    //cout<< i_start<<" "<< j_start<<" "<<i_end<<" "<< j_end<<"\n";
    int i_diff=(i_end - i_start),j_diff=(j_end - j_start);
    int i_diff_abs=abs(i_diff), j_diff_abs=abs(j_diff);
    int k_v_1,k_v_2,k_h;
    int no_moves=0;


    string  d[]={"L","U","L","R"};//lower, upper, left, right change up to low for my perspective
    k_v_1=(j_diff>0)? 0:1;
    k_v_2=(i_diff>0)? 3:2;
    k_h=(i_diff>0)? 3:2;
    vector <string> res;

    if( j_diff_abs%2 ==0 && i_diff_abs%2==1)//convert problem to abs(j_diff)%4==0 && abs(i_diff)%2==0
    {

        res.push_back( d[k_v_1]+ d[k_v_2]);no_moves++;
        //cout<<abs(i_diff)<<"h "<<abs(i_diff)<<"v\n";//Debug
        //cout<<"("<<i_end -i_diff<<", "<<j_end- j_diff<<" )"<<"move"<< *(res.end()-1)<<"\n";//Debug
        i_diff+=(k_v_2==2)? 1:-1;
        j_diff+=(k_v_1==0)?-2: 2;
    }

    if(abs(j_diff)%4==0 && abs(i_diff)%2==0)
    {


        while(abs(j_diff) >0 )// moving vertically
        {
            if(i_diff!=0)
            {
                res.push_back( d[k_v_1]+ d[k_v_2]);no_moves++;
                //cout<<abs(i_diff)<<"h "<<abs(i_diff)<<"v\n";//Debug
                //cout<<"("<<i_end -i_diff<<", "<<j_end- j_diff<<" )"<<"move"<< *(res.end()-1)<<"\n";//Debug
                i_diff+=(k_v_2==2)? 1:-1;
                j_diff+=(k_v_1==0)?-2: 2;
            }
            else
            {
                while(abs(j_diff) >0 )
                {

                    res.push_back( d[k_v_1]+ d[k_v_2]);no_moves++;
                    //cout<<abs(i_diff)<<"h "<<abs(i_diff)<<"v\n";//Debug
                    //cout<<"("<<i_end -i_diff<<", "<<j_end- j_diff<<" )"<<"move"<< *(res.end()-1)<<"\n";//Debug
                    k_v_2=(k_v_2 +1)%2+2;
                    i_diff+=(k_v_2==2)? 1:-1;
                    j_diff+=(k_v_1==0)?-2: 2;
                }
            }

        }
        while(abs(i_diff)>0 )//moving horizontally
        {
            res. push_back(d[k_h]);no_moves++;
            //cout<<abs(i_diff)<<"h "<<abs(i_diff)<<"v\n";//Debug
            //cout<<"("<<i_end -i_diff<<", "<<j_end- j_diff<<" )"<<"move"<< *(res.end()-1)<<"\n";//Debug
            i_diff+=(k_h==2)? 2:-2;
        }

        cout<<no_moves<<"\n";
        for(int i3=0; i3<res.size() ; i3++) cout<< res[i3]<<" ";


    }
    else
    {
        cout<<"Impossible";
    }

}

int main() {

    //freopen("WorldCodeSprint12.txt","r",stdin);//redirects standard input
    //freopen("out.txt","w",stdout);//redirects standard output

    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;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}