#include <bits/stdc++.h>

using namespace std;
int n;
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int m[205][205],im[6]={-2,-2,0,2,2,0},jm[6]={-1,1,2,1,-1,-2};
    string s[6]={"UL","UR","R","LR","LL","L"};
    vector<pair<int,int> > v;
    vector<int> a;
    memset(m,-1,sizeof(m));
    v.push_back({i_start,j_start});
    m[i_start][j_start]=0;
    int k=0;
    while(k<v.size() && (v[k].first!=i_end || v[k].second!=j_end)){
    	
        for(int l=0; l<6; l++){ 
            int i=v[k].first+im[l],j=v[k].second+jm[l];
            if(i>=0 && i<n && j>=0 && j<n) if(m[i][j]==-1){
                v.push_back({i,j});
                m[i][j]=l;
            }        
        } 
        k++;
    }
    int i=i_end, j=j_end;
    if(m[i][j]>-1){
         while(i!=i_start || j!= j_start){ 
            a.push_back(m[i][j]);
            int h=m[i][j];
            i-=im[h];
            j-=jm[h];
        }
        cout<<a.size()<<"\n";
        if(a.size()>0){
            for(int l=a.size()-1; l>0; l--) cout<<s[a[l]]<<" ";
            cout<<s[a[0]]<<"\n";
        }
    }
    else cout<<"Impossible\n";
}

int main() {
    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;
}