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

vector<string>v[201][201] ;
ll dx[] = { -2, -2 , 0 , 2 , 2 , 0 } ;
ll dy[] = { -1 , 1 , 2 , 1 , -1 ,-2 } ;


ll level[201][201] ;
ll n ;
string ara[6] ;

void bfs( ll fx , ll fy ){

     level[fx][fy] = 0 ;
     queue< pair<ll,ll> >q ;
     q.push( make_pair(fx,fy) ) ;
     while(!q.empty()){
        ll sx = q.front().first ;
        ll sy = q.front().second ;
        q.pop() ;
        for( ll i =0 ; i<6 ; ++i ){
             ll zx = sx+dx[i] ;
             ll zy = sy + dy[i] ;
             if( zx>=0 && zx<n && zy>=0 && zy<n ){
                 if( level[zx][zy]>=level[sx][sy]+1 ){
                     level[zx][zy] = level[sx][sy] + 1 ;
                      v[zx][zy].push_back(ara[i]) ;
                      q.push(make_pair(zx,zy)) ;
                 }

             }

        }

     }

}



int main(){

    // freopen("input.txt" , "r" , stdin);
    ll  x  , y , x1 , y1 ;
     cin >> n >> x >> y >> x1 >> y1 ;
     for( ll i =0 ; i<n ; ++i ){
         for( ll j = 0; j<n ; ++j ){
             level[i][j] = n+1 ;
         }
     }
       string ara1[10] ;
       ara[0] = "UL" ; ara1[0]  ="LR";
      ara[1] = "UR" ;  ara1[1] ="LL";
      ara[2] = "R" ;   ara1[2] ="L";
      ara[3] = "LR" ; ara1[3]  ="UL";
      ara[4] = "LL" ; ara1[4]  ="UR";
      ara[5] = "L" ;  ara1[5]  ="R";

     bfs(x1,y1) ;

     if( level[x][y]==n+1 ){
          cout << "Impossible" << endl; return 0 ;
     }else{
         cout << level[x][y] << endl;
         ll lx = x , ly = y ;
         while(true){

             for( ll i = 0 ; i<6 ; ++i ){
                  if( x==x1 && y==y1 ){
                        cout << endl;
                      return 0 ;
                  }
                  ll sz = v[x][y].size() ;
                  for( ll j =0 ; j<sz ; ++j ){
                      if( v[x][y][j]==ara1[i] ){
                         x+=dx[i];
                         y+=dy[i];
                         cout << ara[i] <<" " ;
                         goto down;
                      }
                  }
             }
             down:;
         }
    }

}