#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    if(abs(i_start-i_end)%2!=0)
        {
        cout<<"Impossible";
        return;
        }
       int y=i_start;
       int x=j_start;
    vector<string> u[10];
    int count=0;
    while(y!=i_end)
        {
            count++;
              if(y>i_end)
              {
                 if(x>j_end)
                 {
                     x--;
                     u[0].push_back("UL");
                     y-=2;
                     
                     
                 }
                  else
                  {
                      x++;
                      u[1].push_back("UR");
                      y-=2;
                  }
                  
              }
              else
              {
                  
                if(x>j_end)
                 {
                     x--;
                     u[4].push_back("LL");
                     y+=2;
                     
                 }
                  else
                  {
                      x++;
                      u[3].push_back("LR");
                      y+=2;
                  }
                  
                  
                  
                  
                  
                  
              }
        }
    if(abs(x-j_end)%2!=0)
    {
        cout<<"Impossible";
        return;
        
    }
    while(x!=j_end)
    {
        count++;
        if(x>j_end)
                 {
                     x-=2;
                     u[5].push_back("L");
                //     y+=2;
                     
                 }
                  else
                  {
                      x+=2;
                      u[2].push_back("R");
                      //y+=2;
                  }
                
        
    }
        //int count=0;
    cout<<count<<'\n';
    for(int i=0;i<6;i++)
       // cout<<s[i]<<" ";
    {
        for(int j=0;j<u[i].size();j++)
        cout<<u[i][j]<<" ";
        
    }
    
    
    
    
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}