#include <bits/stdc++.h>
using namespace std;
int n,s1,s2,f1,f2,ansize,fix[201][201];
pair<int,int>a[10];
pair<int,int>parent[201][201];
pair<int,int>ans[2000001];
queue<int>q;
void p(int x,int y,int s1,int s2)
{
    ans[++ansize].first=f1;
    ans[ansize].second=f2;
    
    while (parent[x][y].first!=s1 || parent[x][y].second!=s2)
    {
        ans[++ansize].first=parent[x][y].first;
        ans[ansize].second=parent[x][y].second;
        
        int X=parent[x][y].first;
        int Y=parent[x][y].second;
        
        x=X;
        y=Y;
    }

    ansize++;
    ans[ansize].first=s1;
    ans[ansize].second=s2;
   
    
    for (int i=ansize; i>=1; i--)
        for (int j=1; j<=6; j++)
            if (ans[i+1].first+a[j].first==ans[i].first && ans[i+1].second+a[j].second==ans[i].second)
            {
               if (j==3) cout<<"R ";
               if (j==6) cout<<"L ";
               if (j==2) cout<<"UR ";
               if (j==1) cout<<"UL ";
               if (j==4) cout<<"LR ";
               if (j==5) cout<<"LL ";
            }
}
int main() 
{
    a[3].first=0;
    a[3].second=2;
    
    a[6].first=0;
    a[6].second=-2;
    
    a[2].first=-2;
    a[2].second=1;
    
    a[1].first=-2;
    a[1].second=-1;
    
    a[4].first=2;
    a[4].second=1;
    
    a[5].first=2;
    a[5].second=-1;
    
    cin>>n;
    
    cin>>s1>>s2;
    cin>>f1>>f2;
    
    q.push(s1);
    q.push(s2);
    q.push(0);
    
    fix[s1][s2]=1;
    
    while (!q.empty())
    {
        int x=q.front();
        q.pop();
        
        int y=q.front();
        q.pop();
        
        int s=q.front();
        q.pop();
        
        if (x==f1 && y==f2)
        {
            cout<<s<<endl;
            
            p(x,y,s1,s2);
            
            return 0;
        }
        
        for (int i=1; i<=6; i++)
        {
            int X=x+a[i].first;
            int Y=y+a[i].second;
            
            if (0<=X && X<n && 0<=Y && Y<n && !fix[X][Y])
            {
                fix[X][Y]=1;
                
                parent[X][Y].first=x;
                parent[X][Y].second=y;
                
                q.push(X);
                q.push(Y);
                q.push(s+1); 
            } 
        }
    }

    cout<<"Impossible"<<endl;
    
    return 0;
}