#include <bits/stdc++.h>

using namespace std;
int dy[]={-1 , 1 , 2 , 1 , -1 , -2};
int dx[]={-2 ,  -2 , 0,2,2,0};
int vis[300][300];
pair<int,int> from[222][222] ;
int n ;
bool get(int i , int j ){
    return i>=0 && j >=0 && i<n && j <n ;
}

void bfs(int i , int j , int I , int J){
    memset(vis, -1 ,sizeof vis);
    vis[i][j]=0;
    queue<int> q ;
    q.push(i);
    q.push(j);
    while(!q.empty()){
        i = q.front() ;
        q.pop();
        j = q.front() ;
        q.pop();
//        cout << i << ' ' << j <<endl;
        if(i==I && j==J) return ;
        for(int k = 0 ; k< 6 ;k++){
            int ii = i + dx[k] ;
            int jj = j + dy[k] ;
            if(get(ii,jj) && vis[ii][jj]==-1 ){
                vis[ii][jj]=k;
                from[ii][jj]={i,j};
                q.push(ii);
                q.push(jj);
            }
        }
    }
}

string is[]= {"UL", "UR", "R", "LR", "LL", "L"};

int main()
{
    cin >> n ;
    int a , b , c , d ;
    cin >> a >>b >> c >> d ;
    bfs(a,b,c,d);
    if(vis[c][d]==-1) return cout<< "Impossible" ,0;
    vector<int> path ;
//    cout << 'd';
    int i = c , j = d;
//    cout << i << ' ' << j <<endl;
    while( i!= a ||  j!=b){
        path.push_back(vis[i][j]);
//        cout << vis[i][j] << ' ' ;
        int I = from[i][j].first , J = from[i][j].second;
        i=I, j=J;
    }
    cout<< path.size()  <<endl;
    reverse(path.begin(), path.end());
    for(auto a : path)cout << is[a]<< ' ';
    return 0;
}