#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

#include<queue>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int N;
    cin>>N;
    int i, j, ii, jj;
    cin>>i; cin>>j; cin>>ii; cin>>jj;
    
    vector<vector<int>> b(200, vector<int>(200, -1));
    struct  Dir {int dx; int dy;} dir[6]={{-2, -1}, {-2, 1}, {0, 2}, {2, 1}, {2, -1}, {0, -2}};
    string  dStr[6]={"UL", "UR", "R", "LR", "LL", "L"};
    
    
    queue<pair<int, int>> q;
    q.push({i, j}); 
    b[i][j]=-2;
   
    int step=0;
    while(!q.empty())
    {
        int nQ=q.size();
     
        for(int i=0; i<nQ; ++i)
        {
            int x=q.front().first;
            int y=q.front().second;
            q.pop();
            
            if(x==ii && y==jj) break;
           
            for(int d=0; d<6; ++d)
            {
                int xx=x+dir[d].dx;
                int yy=y+dir[d].dy;
                
                if(xx>=0 && yy>=0 && xx<N && yy<N && b[xx][yy]==-1)
                {
                    b[xx][yy]=d;
                    q.push({xx, yy});
                }
            }
        }
    }
    
    if(b[ii][jj]==-1) 
    {
        cout<<"Impossible"<<endl;
        return 0;
    }
    
    vector<string> v;
    while( b[ii][jj]!=-2 )
    {
        v.push_back(dStr[b[ii][jj]]);
        int xtmp=ii-dir[b[ii][jj]].dx;
        jj-=dir[b[ii][jj]].dy;
        ii=xtmp;
    }
    
    cout<<v.size()<<endl;
    while(!v.empty())
    {
        cout<<v.back()<<" ";
        v.pop_back();
    }
    
    return 0;
}