#include <bits/stdc++.h>

using namespace std;

int mp[205][205];

int dx[6]={-2,-2,0,2,2,0};
int dy[6]={-1,1,2,1,-1,-2};
vector<string>ans;
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    
    queue<pair<int,int>>q;
    q.push(make_pair(i_start,j_start));
    int len=0;
    memset(mp,-1,sizeof(mp));
    mp[i_start][j_start]=0;
    while(!q.empty())
    {
        int si=q.size();
        while(si--)
        {
            int nx=q.front().first;
            int ny=q.front().second;
            q.pop();
            if(nx==i_end&&ny==j_end)
            {
                cout<<len<<endl;
                while(nx!=i_start||ny!=j_start)
                {
                    int te=mp[nx][ny];
                    if(te==0) ans.push_back("UL");
                    if(te==1) ans.push_back("UR");
                    if(te==2) ans.push_back("R");
                    if(te==3) ans.push_back("LR");
                    if(te==4) ans.push_back("LL");
                    if(te==5) ans.push_back("L");
                    nx=nx-dx[te];
                    ny=ny-dy[te];
                }

                reverse(ans.begin(),ans.end());
                for(int i=0;i<ans.size();i++) cout<<ans[i]<<" ";
                cout<<endl;
                return;
            }

            for(int i=0;i<6;i++)
            {
                int tx=nx+dx[i];
                int ty=ny+dy[i];
                if(tx<0||tx>=n||ty<0||ty>=n) continue;
                if(mp[tx][ty]!=-1) continue;
                mp[tx][ty]=i;
                q.push(make_pair(tx,ty));
            }
        }
        len++;
    }
    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;
}