#include <bits/stdc++.h>
using namespace std;
struct node{
    int p,v;
};
int vis[205][205];
node dist[205][205];
int dx[]={-2,-2,0,2,2,0};
int dy[]={-1,1,2,1,-1,-2};
map<int,string> m;
node bfs(int x1,int y1,int x2,int y2,int n){
    queue<pair<int,int> >q;
    q.push(make_pair(x1,y1));
    vis[x1][y1]=1;
    dist[x1][y1].v=0;
    dist[x1][y1].p=-1;
    while(!q.empty()){
        pair<int,int> tp=q.front();
        q.pop();
        int xx=tp.first,yy=tp.second;
        //cout<<xx<<yy<<endl;
        for(int i=0;i<6;i++){
            int x=xx+dx[i],y=yy+dy[i];
            if(x>=0 && y>=0 && x<n && y<n && vis[x][y]==0){
                if(dist[x][y].v > dist[xx][yy].v + 1 ){
                    dist[x][y].v=dist[xx][yy].v+1;
                    dist[x][y].p=i;
                    vis[x][y]=1;
                    q.push(make_pair(x,y));
                }
            }
        }
    }
    return dist[x2][y2];
}
int main() {
    m[0]="UL";
    m[1]="UR";
    m[2]="R";
    m[3]="LR";
    m[4]="LL";
    m[5]="L";
    int n;
    int x1,y1,x2,y2;
    cin>>n;
    cin>>x1>>y1>>x2>>y2;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++)
            dist[i][j].v=INT_MAX;
    }
    node ans = bfs(x1,y1,x2,y2,n);
    //cout<<ans.v;
    if(ans.v==INT_MAX)
            cout<<"Impossible";
    else
    {
        cout<<ans.v<<endl;
        int x1=x2,y1=y2;
        vector<string> v;
        while(dist[x1][y1].p!=-1){
            int pos = dist[x1][y1].p;
            v.push_back(m[pos]);
            x1-=dx[pos];
            y1-=dy[pos];
        }
        reverse(v.begin(),v.end());
        for(auto it=v.begin();it!=v.end();it++){
            cout<<*it<<" ";
        }
    }
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}