#include <bits/stdc++.h>

using namespace std;
void ss(int r,int c,int n,int d1,int d2,vector <string> & v,vector<string> g,string str)
{ if(r>=0&r<n&&c>=0&&c<n)
{ // cout<<r<<"  "<<c<<endl;
    if(str!="")
        g.push_back(str);
    
    if(r==d1&&c==d2)
    {
        if(v.size() ==0|| v.size() > g.size())
            v=g;
        return;
        
    }
    
    
    if(r==d1&&c-2>=d2)
    ss(r,c-2,n,d1,d2,v,g,"L");
   if(r==d1&&c+2<=d2)
    ss(r,c+2,n,d1,d2,v,g,"R");
  
    
    if((r-2>=d1&&c-1 >=d2 ))
    ss(r-2,c-1,n,d1,d2,v,g,"UL");
    if(r-2>=d1&&c+1 <= d2 )
    ss(r-2,c+1,n,d1,d2,v,g,"UR");
    
    
    
    if((d1 >r&&d2 >c)|| c==d2)
    ss(r+2,c+1,n,d1,d2,v,g,"LR");
    if((d1 >r&&d2<c)|| c==d2)
    ss(r+2,c-1,n,d1,d2,v,g,"LL");
    
    
    
}
else return;
}


void printShortestPath(int n, int s1, int s2, int e1, int e2) {
    
    vector<string> ans ;
    vector<string> temp;
    ss( s1,s2,n,e1,e2,ans,temp,"");
    
    if(ans.size()==0)
        cout<<"Impossible";
    else
    {
        cout<<ans.size()<<endl;
        for(string h:ans)
            cout<<h<<" ";
    }
}

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;
}