#include<bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

struct cell{
    int x;
    int y;
    int dist;
};

bool isinside(int x, int y, int n){
    if(x>=0 && x<n && y>=0 && y<n)  return true;
    return false;
}
    int n, xbeg, ybeg, xend, yend, x, y, par[8120602], baap=0, cnt=1, dir[8120602];
    bool viz[1000][1000], flag=0;

int main()
{

    cell t;
    vector<int> v;

    cin>>n>>xbeg>>ybeg>>xend>>yend;

    int dx[6]={-2, -2, 0, 2, 2, 0};
    int dy[6]={-1, 1, 2, 1, -1, -2};

    queue<cell> q;
    q.push({xbeg, ybeg, 0});

    memset(viz, 0, sizeof(viz));
    memset(par, 0, sizeof(par));
    viz[xbeg][ybeg]=1;

    while(!q.empty()){

        t=q.front();
        q.pop();
        viz[t.x][t.y]=1;


        for(int i=0; i<6; i++){
            x=t.x + dx[i];
            y=t.y + dy[i];

            if(isinside(x, y, n) && !viz[x][y]){
                q.push({x, y, t.dist+1});
                par[cnt]=baap;
                dir[cnt]=i;
                cnt++;
            }
        }


        if(t.x==xend && t.y==yend){
            cout<<t.dist<<endl;
            flag=1;
            while(baap){
                v.pb(dir[baap]);
                baap=par[baap];
            }
            reverse(v.begin(), v.end());
            for(auto& u: v){
                if(u==0)            cout<<"UL ";
                else if(u==1)       cout<<"UR ";
                else if(u==2)       cout<<"R ";
                else if(u==3)       cout<<"LR ";
                else if(u==4)       cout<<"LL ";
                else if(u==5)       cout<<"L ";

            }

            break;
        }
    baap++;


    }

    if(!flag)   cout<<"Impossible";





    return 0;
}