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



    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    char c[7];

    struct cell
    {
        int x,y, dis;
        cell() {}
        cell(int x,int y, int dis) : x(x), y(y), dis(dis) {}
    };
    
    bool isInside(int x, int y, int N)
    {
        if(x >= 0 && x <= (N-1) && y >= 0 && y <= (N-1))
           return true;
        return false;
    }
    
    int minStepToReachTarget(int knightpos[], int targetpos[], int N)
    {
        int dx[] = {-1, 1, 2, 1, -1, -2};   
        int dy[] = {-2, -2, 0, 2, 2, 0};
        unsigned char mo[] = {'U', 'U', 'R', 'L', 'L', 'L','\0'};
        
        queue<cell> q;
        
        q.push(cell(knightpos[0], knightpos[1], 0));
        
        cell t;
        int x,y;
        bool visit[N][N];
        
        for(int i=0;i<N;i++)
            for(int j=0;j<N;j++)
                visit[i][j] = false;
        
        visit[knightpos[0]][knightpos[1]] = true;
        
        while(!q.empty())
        {
            t = q.front();
            q.pop();
            visit[t.x][t.y] = true;
            
            if( t.x == targetpos[0] && t.y == targetpos[1])
                return t.dis;
            
            for(int i=0;i<6;i++)
            {
                x = t.x + dx[i];
                y = t.y + dy[i];
                c[i] = mo[i];
                
                
                if(isInside(x,y,N) && !visit[x][y])
                    q.push(cell(x,y,t.dis + 1));
            }
        }
        
        return 0;
    }  

int main() {
    
    int N;
    cin>>N;
    
    int knightpos[2];
    int targetpos[2];
    
    for(int i=0 ;i<2 ; i++)
        cin>>knightpos[i];
    
    for(int i=0;i<2;i++)
        cin>>targetpos[i];
    
    int res = minStepToReachTarget(knightpos, targetpos, N);
    
    if(res == 0)
        cout<<"Impossible";
    else
    { cout<<res<<endl;
      for(int i=0;i<res;i++)
          cout<<c[i]<<" ";
    }
    
    
}