#include <bits/stdc++.h>
using namespace std;
int i_start;
    int j_start;
    int i_end;
    int j_end;
int n;
int dy[]={-1,1,2,1,-1,-2};
int dx[]={-2,-2,0,2,2,0};
string mapping[]={"UL", "UR", "R", "LR", "LL", "L"};
map <pair <int,int  >,int> mapi;
bool check(int x,int y) {
    if(x>=0 && y>=0 && x<n && y<n)
    {
        return true;
    }
    return false;
}
int vis[300][300];
void bfs() {
    queue <pair <int,int > > q;
    q.push(make_pair(i_start,j_start));
    vis[i_start][j_start]=0;
    while(!q.empty()) {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        for(int i=0;i<6;i++) {
            if(check(x+dx[i],y+dy[i]) && vis[x+dx[i]][y+dy[i]]==-1) {
                q.push(make_pair(x+dx[i],y+dy[i]));
                vis[x+dx[i]][y+dy[i]] = vis[x][y]+1;
                mapi[make_pair(x+dx[i],y+dy[i])] = i;
             //   cout<<x+dx[i]<<" "<<y+dy[i]<<" "<<i<<endl;
            }
        }
    }
}

void printShortestPath() {
    //  Print the distance along with the sequence of moves.
    bfs();
    if(vis[i_end][j_end]==-1) {
        cout<<"Impossible"<<endl;
        return;
    }
    cout<<vis[i_end][j_end]<<endl;
    vector <int> v;
    int x = i_end;
    int y = j_end;
    while(true) {
      //  cout<<x<<" "<<y<<endl;
        if(x==i_start && y==j_start) {
            break;
        }
        v.push_back(mapi[make_pair(x,y)]);
        int df = mapi[make_pair(x,y)];
        x=x-dx[df];
        y=y-dy[df];
    }
    for(int i=v.size()-1;i>=0;i--) {
        cout<<mapping[v[i]]<<" ";
    }
    
}

int main() {
    for(int i=0;i<300;i++)
    {
        for(int j=0;j<300;j++) {
             vis[i][j] = -1; 
        }
       
    }
    cin >> n;
    
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath();
    return 0;
}