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

#define MAX 203

int n,x,y,a,b;
bool visit[MAX][MAX];
string ans[MAX][MAX];
pair<int,int> from[MAX][MAX];

int dy[6]={2,2,0,-2,-2,0};
int dx[6]={-1,1,2,1,-1,-2};
string ds[6]={"UL","UR","R","LR","LL","L"};
void bfs()
{
    queue<pair<int,int> > q;
    q.push(make_pair(y,x));
    while(!q.empty())
    {
        int yy=q.front().first;
        int xx=q.front().second;
        q.pop();
        visit[yy][xx]=true;
        for(int i=0;i<6;i++)
        {
            if(yy+dy[i]>=0 && yy+dy[i]<n && xx+dx[i]>=0 && xx+dx[i]<n && !visit[yy+dy[i]][xx+dx[i]])
            {
                q.push(make_pair(yy+dy[i],xx+dx[i]));
                from[yy+dy[i]][xx+dx[i]]=make_pair(yy,xx);
                ans[yy+dy[i]][xx+dx[i]]=ds[i];
                visit[yy+dy[i]][xx+dx[i]]=true;
            }             
        }
    }
}
int main()
{
    cin>>n>>y>>x>>b>>a; 
    y=n-1-y;
    b=n-1-b;
    bfs();
    
    if(visit[b][a])
    {      
        pair<int,int> it(b,a);
        vector<string> res;       
        while(it.first!=y || it.second!=x)
        {
            res.push_back(ans[it.first][it.second]);
            it=from[it.first][it.second];
        }
        cout<<res.size()<<endl;
        for(int i=res.size()-1;i>=0;i--)
        {
            if(i!=res.size()-1)
                cout<<" ";
            cout<<res[i];
        }      
        
    }
    else
        cout<<"Impossible\n";
    return 0;
}