#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.
    vector<int> xqu;
    vector<int> yqu;
    int vis[n][n];
    //memset(vis,-1,sizeof(vis));
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            vis[i][j] = -1;
        }
    }
    vector<string> par;
    xqu.push_back(i_start);
    yqu.push_back(j_start);
    vector<int> pare;
    pare.push_back(-1);
    par.push_back("");
    int ind = 0;
    
    vis[xqu[ind]][yqu[ind]] = 0;
    //UL, UR, R, LR, LL, L
    while(ind<xqu.size()){
        int x = xqu[ind];
        int y = yqu[ind];
        int val = vis[x][y]+1;
        //cout<<x<<" "<<y<<" "<<endl;
        if(x==i_end && y==j_end){
            break;
        }
    
       
        string  s = "UL";
        if(y-1>=0 && x-2>=0 && vis[x-2][y-1]==-1){
            vis[x-2][y-1] = val;
            xqu.push_back(x-2);
            yqu.push_back(y-1);
            par.push_back(s);
            pare.push_back(ind);
        }
         s = "UR";
        if(y+1<n && x-2>=0 && vis[x-2][y+1]==-1){
            vis[x-2][y+1] = val;
            xqu.push_back(x-2);
            yqu.push_back(y+1);
            par.push_back(s);
            pare.push_back(ind);
        }
          s = "R";
        if(y+2<n&&vis[x][y+2]==-1){
            vis[x][y+2] = val;
            xqu.push_back(x);
            yqu.push_back(y+2);
            par.push_back(s);
            pare.push_back(ind);
        }
        
         s = "LR";
        if(y+1<n && x+2<n && vis[x+2][y+1]==-1){
            vis[x+2][y+1] = val;
            xqu.push_back(x+2);
            yqu.push_back(y+1);
            par.push_back(s);
            pare.push_back(ind);
        }
         s = "LL";
        if(y-1>=0 && x+2<n && vis[x+2][y-1]==-1){
            vis[x+2][y-1] = val;
            xqu.push_back(x+2);
            yqu.push_back(y-1);
            par.push_back(s);
            pare.push_back(ind);
        }
        s = "L";
        if(y-2>=0&&vis[x][y-2] == -1){
            vis[x][y-2] = val;
            xqu.push_back(x);
            yqu.push_back(y-2);
            par.push_back(s);
            pare.push_back(ind);
        }
        ind++;
        
    }
    if(ind<xqu.size()){
        vector<string> res;
        int x = xqu[ind];
        int y = yqu[ind];
        int ans = vis[x][y];
        while(ind>0){
            //cout<<ind<<" "<<par[ind]<<" "<<pare[ind]<<endl;
            res.push_back(par[ind]);
            ind = pare[ind];
        }
        if(ans>0){
            cout<<ans<<endl;
            for(int i=res.size()-1;i>=0;i--){
                cout<<res[i]<<" ";
            }
            cout<<endl;
        }else{
            cout<<ans<<endl;
        }
        
        
    }else{
        cout<<"Impossible"<<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;
}