//Coded by : devACE
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define F first
#define S second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lld I64d
#define ii  pair<int,int>
ll xen,yen,xst,yst;
vector<string>v,ans;
void path()
{
    if(xst==xen&&yst==yen)return;
    else
    {
        if(xst>=xen)
        {
          if(yen>yst)
          {
              ans.pb("UL");
              xst--;
              yst+=2;
          }
          else if(yen==yst)
          {
              ans.pb("L");
              xst-=2;
          }
          else
          {
              ans.pb("LL");
              xst--;
              yst-=2;
          }
        }
        else
        {
            if(yen==yst)
            {
                ans.pb("R");
                xst+=2;
            }
            else if(yen>yst)
            {
                ans.pb("UR");
                xst++;
                yst+=2;
            }
            else
            {
                ans.pb("LR");
                xst++;
                yst-=2;
            }
        }
        path();
    }
}
int main()
{
    ios
    ll n,m,i,j,k,num,test=1;
    //freopen("input.txt","r",stdin);   //for reading from input.txt file
    //freopen("output.txt","w",stdout); //for writing in output.txt file
    //cin>>test;
    while(test--)
    {
      cin>>n;
      map<string,ll>a;
      a["UL"]=0;
      a["RL"]=1;
      a["R"]=2;
      a["LR"]=3;
      a["LL"]=4;
      a["L"]=5;
      ll ydr,xdr,X,Y;
      cin>>xst>>yst>>xen>>yen;
      xst=n-xst,xen=n-xen;
      swap(xst,yst);
      swap(xen,yen);
      ydr=(yst==yen)?0:abs(yen-yst)/(yen-yst);
      Y=abs(yen-yst);
      if(Y&1)cout<<"Impossible";
      else
      {
          Y/=2;
          if(abs(abs(xen-xst)-abs(Y))&1)cout<<"Impossible";
          else
          {
             path();
             vector<pair<ll,string> >ar;
             for(i=0;i<ans.size();i++)
             {
              ar.pb({a[ans[i]],ans[i]});
             }
             sort(ar.begin(),ar.end());
             cout<<ar.size()<<"\n";
             for(i=0;i<ar.size();i++)cout<<ar[i].S<<" ";
          }
      }
      }
    }