#include <bits/stdc++.h>
using namespace std;

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int n;
    cin>>n;
    
    int is,js,ie,je;
    cin>>is>>js>>ie>>je;
    
    int im[6] = {-2,-2,0,2,2,0};
    int jm[6] = {-1,1,2,1,-1,-2};
    
    string P[6] = {"UL","UR","R","LR","LL","L"};
    
    queue<pair<int,int> > q;
    
    q.push(make_pair(is,js));
    
    bool vis[n][n];
    memset(vis,false,sizeof(vis));
    int Mov[n][n];
    memset(Mov,-1,sizeof(Mov));
    Mov[is][js] = -1;
    
    vis[is][js] = true;
    
    while(!q.empty())
    {
        pair<int,int> A = q.front();
        int a = A.first,b = A.second;
        
        if(a==ie && b==je)
            break;
        
        q.pop();
        
        for(int i=0;i<6;i++)
        {
            int u = a+im[i],v = b+jm[i];
            if(u>=0 && u<n && v>=0 && v<n && !vis[u][v])
            {
                vis[u][v] = true;
                q.push(make_pair(u,v));
                Mov[u][v] = i;
            }
        }
    }
    
    if(!q.empty())
    {
        pair<int,int> A = q.front();
        int a = A.first,b = A.second,c = Mov[a][b];
        int count=0;
        stack<string> st;
        while(c!=-1)
        {
            st.push(P[c]);
            a = a-im[c]; b = b-jm[c];
            c = Mov[a][b];
            count++;
        }
        
        if(a==is && b==js)
        {
            cout<<count<<endl;
            while(!st.empty())
            {
                cout<<st.top()<<" ";
                st.pop();
            }
            cout<<endl;
        }
        else
        {
            cout<<"Impossible"<<endl;
        }
    }
    else
        cout<<"Impossible"<<endl;
    return 0;
}