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

int n,sx , sy , dx , dy;
   
int level[207][207];
string parentMove[207][207];
map<string , string> reverseMove;
string moves[] = {"UL" , "UR" , "R" , "LR" , "LL" , "L"};

pair<int , int> applyMove(pair<int , int> p , string s){
    if(s=="L") p.second -= 2;    
    else if(s=="R") p.second += 2;
    else if(s=="UL") p.first -= 2 , p.second -= 1;
    else if(s=="UR") p.first -= 2 , p.second += 1;
    else if(s=="LL") p.first += 2 , p.second -= 1;
    else p.first += 2 , p.second += 1;
    return p;
}

string detectMove(pair<int , int> p , pair<int , int> q){
    
    for(int i=0;i<6;++i) 
        if(applyMove(p , moves[i]) == q) 
            return moves[i];
    return "NULL";
}

bool isValid(pair<int , int> p){
    return p.first>=0 && p.second >=0 && p.first < n && p.second < n;
}

void reverseMoves(){
    for(int i=0;i<6;++i)
        reverseMove[moves[i]] = moves[(i+3)%6];
}

void solve(){
    
    for(int i=0;i<n;++i)
        for(int j=0;j<n;++j)
            level[i][j] = -1 , parentMove[i][j] = "NULL";
    level[sx][sy] = 0;
    
    queue<pair<int , int> > q;
    q.push(make_pair(sx , sy));
    int flag = 0;
    
    while(!q.empty()){
        pair<int , int> x = q.front();
        q.pop();
        for(int i=0;i<6;++i){
            pair<int , int> y = applyMove(x , moves[i]);
            if(!isValid(y) || level[y.first][y.second] != -1) continue;
            level[y.first][y.second] = level[x.first][x.second]+1;
            parentMove[y.first][y.second] = moves[i];
            q.push(y);
            if(y.first == dx && y.second == dy){
                ++flag;
                break;
            }
        }
        if(flag) break;
    }
    
    if(level[dx][dy] == -1){
        cout << "Impossible" << endl;
        return;
    }
    
    cout << level[dx][dy] << endl;
    stack<string> s;
    int x = dx , y = dy;
    while(x != sx || y != sy){
        s.push(parentMove[x][y]);
        pair<int , int> p = applyMove(make_pair(x , y) , reverseMove[parentMove[x][y]]);
        x = p.first , y = p.second;
    }
    while(!s.empty()){
        cout << s.top() << " ";
        s.pop();
    }
}

int main() {
    reverseMoves();
    cin >> n >> sx >> sy >> dx >> dy;
    solve();
    return 0;
}