#include <bits/stdc++.h>
#define llt long long int
using namespace std;

llt n;
llt visited[200][200];
llt sy,sx,ey,ex;
llt dy[6] = {-2,-2,0,2,2,0};
llt dx[6] = {-1,1,2,1,-1,-2};
string f[6] = {"UL","UR","R","LR","LL","L"};

void bfs(llt sy,llt sx,llt ey,llt ex)
{
    queue<pair<llt,llt> > q;
    q.push({sy,sx});
    
    while(!q.empty())
    {
        llt ny = q.front().first;
        llt nx = q.front().second;
        q.pop();
        
        for(llt i=0;i<6;i++)
        {
            llt y = ny + dy[i];
            llt x = nx + dx[i];
            
            if(y>=0 && y<n && x>=0 && x<n && visited[y][x]==-1)
            {
                q.push({y,x});
                visited[y][x] = i;
                
                if(y == ey && x == ex)
                    return ;
            }
        }
    }
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    memset(visited,-1,sizeof(visited));
    cin >> n;
    cin >> sy >> sx >> ey >> ex;
    
    bfs(sy,sx,ey,ex);
    
    if(visited[ey][ex] == -1)
        cout << "Impossible";
    else
    {
        vector<string> v;
        llt cnt=0;
        while(ey-sy != 0 || ex-sx!=0)
        {
            cnt++;
            llt i = visited[ey][ex];
            v.push_back(f[i]);
            ey = ey - dy[i];
            ex = ex - dx[i];
        }
        
        cout << cnt << '\n';
        for(llt i=v.size()-1;i>=0;i--)
            cout << v[i] << " ";
    }
    return 0;
}