#include <bits/stdc++.h>
using namespace std;
int n,sx,sy,ex,ey,i,j;
map<int,map<int,vector<string>>>m;
int dx[]={-1,1,2,1,-1,-2};
int dy[]={-2,-2,0,2,2,0};
bool vis[201][201];
vector<string>pos={"UL","UR","R","LR","LL","L"};
bool check(vector<string>v1,vector<string>v2,string now)
{
    v1.push_back(now);
    if(v1.size()<v2.size()||v2.size()==0)
    {
        return true;
    }
    else if(v1.size()==v2.size())
    {
        for(int j=0;j<6;j++)
        {
        if(find(pos.begin(),pos.end(),v1[j])<=find(pos.begin(),pos.end(),v2[j]))
            continue;
        else
            return false;
        }
        return true;
    }
    return false;
}
void init()
{
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            vis[i][j]=true;
}
void dfs(int currx,int curry,int sx,int sy)
{
   for(i=0;i<=5;i++)
   {
       if(currx==sx&&curry==sy)
       {
       init();
       }
       if(currx+dx[i]>=0&&currx+dx[i]<n&&curry+dy[i]>=0&&curry+dy[i]<n&&vis[currx+dx[i]][curry+dy[i]])
       {
          
           vis[currx+dx[i]][curry+dy[i]]=false;
           if(check(m[currx][curry],m[currx+dx[i]][curry+dy[i]],pos[i]))
           {
               m[currx+dx[i]][curry+dy[i]].clear();
           m[currx+dx[i]][curry+dy[i]]=m[currx][curry];
           m[currx+dx[i]][curry+dy[i]].push_back(pos[i]);
      
               dfs(currx+dx[i],curry+dy[i],sx,sy);
           }
           
       }
       
   }
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    ios::sync_with_stdio(0);
    cin>>n;
    cin>>sy>>sx>>ey>>ex;
    vector<string>o;
    o.clear();
    m[sx][sy]=o;
   dfs(sx,sy,sx,sy);
    if(m[ex][ey].size()>0)
    {
    cout<<m[ex][ey].size()<<"\n";
        for(auto u:m[ex][ey])
            cout<<u<<" ";
    }
    else
        cout<<"Impossible";
    return 0;
}