#include<bits/stdc++.h>
using namespace std;

int dx[6]={-2,-2,0,2,2,0};
int dy[6]={-1,1,2,1,-1,-2};
int vis[101][101];
int n,f=0;
vector<int> ans,fans;
int A,B,C,D;
int isin(int x,int y)
{
    if(x>=0 && x<n && y>=0 && y<n) return 1;
    return 0;
}
string s[6]={"UL","UR","R","LR","LL","L"};
void dfs(int x,int y)
{
    vis[x][y]=1;
    if(x==C && y==D) 
    {
       // cout<<ans.size()<<endl;
        if(fans.size() == 0) fans=ans;
        else if(fans.size() > ans.size()) fans=ans;
        vis[x][y]=0;
        return;
    }
    for(int i=0;i<6;i++)
    {
        int X=x+dx[i];
        int Y=y+dy[i];
        if(isin(X,Y) && vis[X][Y] == 0)
        {
            ans.push_back(i);
           // cout<<X<<y<<endl;
            dfs(X,Y);
            ans.pop_back();
        }
    }
    vis[x][y]=0;
    return ;
}
int main() {
    cin>>n;
    cin>>A>>B>>C>>D;
    for(int i=0;i<6;i++)
    {
        int X=A+dx[i];
        int Y=B+dy[i];
        if(isin(X,Y) && vis[X][Y] == 0)
        {
            ans.push_back(i);
            dfs(X,Y);
            ans.pop_back();
        }
    }
    if(fans.size() == 0)
    {
        cout<<"Impossible";
        return 0;
    }
    cout<<fans.size()<<endl;
    for(int i=0;i<fans.size();i++) cout<<s[fans[i]]<<' ';
    return 0;
}