#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define LOG1(a)			  cerr<< #a << " = " << (a) << "\n"
#define LOG2(a, b)		  cerr<< #a << " = " << (a) << ", " << #b << " = " << (b) << "\n"
#define LOG3(a, b, c)     cerr<< #a << " = " << (a) << ", " << #b << " = " << (b) << ", "<< #c << " = " << (c) << "\n"
#define LOG4(a, b, c, d)  cerr<< #a << " = " << (a) << ", " << #b << " = " << (b) << ", "<< #c << " = " << (c) << ", " << #d << " = " << (d) << "\n"
#define endl "\n"

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<long long int> vll;

const double EPS = 1e-9;
const double pi = acos(-1);
const ll INF = 1e18;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const int nax = 200 + 10;

int visited[nax][nax],dist[nax][nax],reachable[nax][nax];
vector<string> v;
vector<string>str;
int n;
bool isvalid(int x, int y)
{
    if(x<0||y<0||x>=n||y>=n)return false;
    return true;
}
int dx[]={-2,-2,0,2,2,0};
int dy[]={-1,1,2,1,-1,-2};

void printShortestPath(int n, int x, int y, int fx, int fy) {

    queue<int> q;
    q.push(x);
    q.push(y);
    visited[x][y]=1;
    while(!q.empty())
    {
        int xx=q.front();q.pop();
        int yy=q.front();q.pop();
       // cout<<xx<<" "<<yy<<endl;
        for(int i=0;i<6;i++)
        {
            int xxx=xx+dx[i];
            int yyy=yy+dy[i];
            if(isvalid(xxx,yyy)==false)continue;
            if(visited[xxx][yyy]==0)
            {
                visited[xxx][yyy]=1;
                dist[xxx][yyy]=1+dist[xx][yy];
                q.push(xxx);
                q.push(yyy);
            }
        }
    }
    /*for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)cout<<dist[i][j]<<" ";
        cout<<endl;
    }*/
    //cout<<endl;
    q.push(fx);
    q.push(fy);
    reachable[fx][fy]=0;
    memset(visited,0,sizeof(visited));
    visited[fx][fy]=1;
    while(!q.empty())
    {
        int xx=q.front();q.pop();
        int yy=q.front();q.pop();
       // cout<<xx<<" "<<yy<<endl;
        for(int i=0;i<6;i++)
        {
            int xxx=xx+dx[i];
            int yyy=yy+dy[i];
            if(isvalid(xxx,yyy)==false)continue;
            if(visited[xxx][yyy]==0)
            {
                reachable[xxx][yyy]=1+reachable[xx][yy];
                visited[xxx][yyy]=1;
                //dist[xxx][yyy]=1+dist[xx][yy];
                q.push(xxx);
                q.push(yyy);
            }
        }
    }
   /*for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)cout<<reachable[i][j]<<" ";
        cout<<endl;
    }*/
    int ans= dist[fx][fy];
   // cout<<ans<<endl;
    if(ans==0)
    {
        cout<<"Impossible";
        exit(0);
    }
    int req=1;
    int px=-1,py=-1;
    memset(visited,0,sizeof(visited));
    visited[x][y]=1;
    while(x!=fx||y!=fy)
    {
        for(int i=0;i<6;i++)
        {
            int xx=x+dx[i];
            int yy=y+dy[i];
            if(isvalid(xx,yy)==false)continue;
            if(dist[xx][yy]+reachable[xx][yy]==ans&&visited[xx][yy]==0&&dist[xx][yy]==req)
            {
                req++;
                visited[xx][yy]=1;
                px=x;
                py=y;
                x=xx;
                y=yy;
                v.pb(str[i]);
                break;
            }
        }
     //cout<<x<<" "<<y<<endl;
    }
    cout<<v.size()<<endl;
    for(auto x:v)
        cout<<x<<" ";
}

int main() {
    cin >> n;
    str.pb("UL");
    str.pb("UR");
    str.pb("R");
    str.pb("LR");
    str.pb("LL");
    str.pb("L");
    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;
}