#include <bits/stdc++.h>

using namespace std;

struct position
{
int x;
int y;
};

void set_distance(vector<position> temp,position end,vector<vector<int> > &visited,int n)
{
    vector<position> next;
    
    while(temp.size()!=0)
    {
        int i,j;
        position front = temp.front();
        i = front.x;
        j=  front.y;


        if(i==end.x && j==end.y)
        {
            return;
        }
        
        temp.erase(temp.begin());
        int count = visited[i][j]+1;




        if(j-2>=0)
         {
            if(visited[i][j-2]==0)
            {
                visited[i][j-2]=count;
                position n;
                n.x = i;
                n.y = j-2;
                next.push_back(n);
            }
         }

        if(j-1>=0)
        {
            if(i-2>=0)
            {
                if(visited[i-2][j-1]==0)
                {
                    visited[i-2][j-1] = count;
                    position n1;
                    n1.x = i-2;
                    n1.y = j-1;
                    next.push_back(n1);
                } 
            }

            if(i+2<n)
            {
                if(visited[i+2][j-1]==0)
                {
                    visited[i+2][j-1]=count;
                    position n2;
                    n2.x = i+2;
                    n2.y = j-1;
                    next.push_back(n2);
                }             
            }
        }

         if(j+2<n)
        {
            if(visited[i][j+2]==0)
            {
                visited[i][j+2]=count;
                position n3;
                n3.x = i;
                n3.y = j+2;
                next.push_back(n3);
            }        
        }

        if(j+1<n)
        {
            if(i-2>=0)
            {
                if(visited[i-2][j+1]==0)
                {
                    visited[i-2][j+1]=count;
                    position n4;
                    n4.x = i-2;
                    n4.y = j+1;
                    next.push_back(n4);
                } 
            }

            if(i+2<n)
            {
                if(visited[i+2][j+1]==0)
                {
                    visited[i+2][j+1]=count;
                    position n5;
                    n5.x = i+2;
                    n5.y = j+1;
                    next.push_back(n5);
                }             
            }       
        }
    }

    if(next.size()!=0)
        set_distance(next,end,visited,n);

}

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.   
    vector<vector<int> > visited(n,vector<int>(n));
    

    for(int i=0;i<n;i++)
    {      
        for(int j=0;j<n;j++)
        {
            visited[i].push_back(0);
        }
    }

    visited[i_end][j_end]=1;
    vector<position> que;
    
    position temp;
    temp.x = i_end;
    temp.y = j_end;

    position end;
    end.x = i_start;
    end.y = j_start;

    que.push_back(temp);
    set_distance(que,end,visited,n);

/*    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            cout<<visited[i][j];
        }
        cout<<endl;
    }
*/

    if(visited[i_start][j_start]==0)
        cout<<"Impossible"<<endl;
    else
    {
        int result = visited[i_start][j_start];
        int x,y;
        x=i_start;
        y=j_start;
        int count = result-1;
        cout<<result-1<<endl;
        vector<position> ans;
        while(count!=0)
        {
            if(x-2>=0)
            {
                if(y-1>=0)
                {
                    if(visited[x-2][y-1]==count)
                    {
                        cout<<"UL"<<" ";
                        count--;
                        x=x-2;
                        y=y-1;
                        continue;
                    }
                }

                if(y+1<n)
                {
                    if(visited[x-2][y+1]==count)
                    {
                        cout<<"UR"<<" ";
                        count--;
                        x=x-2;
                        y=y+1;
                        continue;
                    }   
                }
            }

            if(y+2<n)
            {
                if(visited[x][y+2]==count)
                {
                    cout<<"R"<<" ";
                    count--;
                    y=y+2;
                    continue;
                }
            }

            if(x+2<n)
            {
                if(y+1<n)
                {
                    if(visited[x+2][y+1]==count)
                    {
                        cout<<"LR"<<" ";
                        count--;
                        x=x+2;
                        y=y+1;
                        continue;
                    }
                }

                if(y-1>=0)
                {
                    if(visited[x+2][y-1]==count)
                    {
                        cout<<"LL"<<" ";
                        count--;
                        x=x+2;
                        y=y-1;
                        continue;
                    }
                }

            }

        if(y-2>=0)
        {
            if(visited[x][y-2]==count)
            {
                count--;
                cout<<"L"<<" ";
                y=y-2;
            }
        }

        }
        cout<<endl;
    }
}

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