#include <cmath>
#include <bits/stdc++.h>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int n,sx,sy,ex,ey;
bool vis[500][500];
int dis[500][500];
int kaise[500][500];
pair<int,int> kahan[500][500];
bool check(int x,int y)
{
    if(x>=0 && x<n && y>=0 && y<n && vis[x][y]==false)
        return true;
    
    return false;
}
void bfs(int x,int y)
{
    queue<pair<int,int>> q;
    q.push({x,y});
    vis[x][y]=1;
    dis[x][y]=0;
    kaise[x][y]=-1;
    kahan[x][y]=make_pair(-1,-1);
    while(q.empty()==0)
    {
        pair<int,int> temp=q.front();
        q.pop();
        
        int x1=temp.first;int y1=temp.second;
    //    if(x1==ex && y1==ey) break;
        int cdis=dis[x1][y1];
        if(check(x1-2,y1-1))
        {
            vis[x1-2][y1-1]=1;
            dis[x1-2][y1-1]=1+cdis;
            kaise[x1-2][y1-1]=1;
            q.push({x1-2,y1-1});
            kahan[x1-2][y1-1]=make_pair(x1,y1);
        }
        if(check(x1-2,y1+1))
        {
            vis[x1-2][y1+1]=1;
            dis[x1-2][y1+1]=1+cdis;
            kaise[x1-2][y1+1]=2;
             q.push({x1-2,y1+1});
            kahan[x1-2][y1+1]=make_pair(x1,y1);
        }
        if(check(x1,y1+2))
        {
            vis[x1][y1+2]=1;
            dis[x1][y1+2]=1+cdis;
            kaise[x1][y1+2]=3;
             q.push({x1,y1+2});
            kahan[x1][y1+2]=make_pair(x1,y1);
        }
        if(check(x1+2,y1+1))
        {
             vis[x1+2][y1+1]=1;
            dis[x1+2][y1+1]=1+cdis;
            kaise[x1+2][y1+1]=4;
             q.push({x1+2,y1+1});
            kahan[x1+2][y1+1]=make_pair(x1,y1);
        }
        if(check(x1+2,y1-1))
        {
             vis[x1+2][y1-1]=1;
            dis[x1+2][y1-1]=1+cdis;
            kaise[x1+2][y1-1]=5;
             q.push({x1+2,y1-1});
            kahan[x1+2][y1-1]=make_pair(x1,y1);
        }
        if(check(x1,y1-2))
        {
             vis[x1][y1-2]=1;
            dis[x1][y1-2]=1+cdis;
            kaise[x1][y1-2]=6;
             q.push({x1,y1-2});
            kahan[x1][y1-2]=make_pair(x1,y1);
        }
        
        
    }
   /* for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            cout<<kaise[i][j]<<" ";
        }
        cout<<endl;
    }*/
    if(dis[ex][ey]==0)
    {
        cout<<"Impossible"<<endl;
        return;
    }
    cout<<dis[ex][ey]<<endl;
    int k1,k2;
    int naya1,naya2;
    vector<string> ans;
    naya1=ex;naya2=ey;
    while(1)
    {
        int where=kaise[naya1][naya2];
       // cout<<naya1<<" "<<naya2<<" "<<where<<endl;
        if(where==1)
        {
            ans.push_back("UL");
        }
        else if(where==2)
        {
           ans.push_back("UR");
        }
         else if(where==3)
        {
            ans.push_back("R");
        }
         else if(where==4)
        {
            ans.push_back("LR");
        }
         else if(where==5)
        {
           ans.push_back("LL");
        }
         else if(where==6)
        {
            ans.push_back("L");
        }
        k1=kahan[naya1][naya2].first;
        k2=kahan[naya1][naya2].second;
        //cout<<k1<<" "<<k2<<endl;
        naya1=k1;
        naya2=k2;
        if(k1==sx && k2==sy)break;
    }
        for(int i=ans.size()-1;i>=0;i--)
            cout<<ans[i]<<" ";
    }
    

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
   memset(vis,false,sizeof(vis));
   memset(dis,0,sizeof(dis));
    //memset(kahan,0,sizeof(kahan));
    memset(kaise,0,sizeof(kaise));
    cin>>n>>sx>>sy>>ex>>ey;
    if(sx==ex && sy==ey)
    {
        cout<<"0"<<endl;
        return 0;
    }
        bfs(sx,sy); 
    return 0;
}