//    Author: Niraj vadhaiya
        #include<bits/stdc++.h>
        using namespace std;
        #define mod 1000000007
        #define pb push_back
        #define ll long long
        #define ld long double
        #define mp make_pair
        #define f first
        #define s second

    ll gcd(ll a,ll b)
        { if(a<b) {a=a^b;b=a^b;a=a^b;} if(b==0)return a; ll t; while(b){t=b; b=a%b; a=t;}return a;}        
    ll lcm(ll a,ll b){ return (a*b)/gcd(a,b); }
    
    ll powermod(ll _a,ll _b,ll _m=mod)
        {ll _r=1;while(_b){if(_b%2==1)_r=(_r*_a)%_m;_b/=2;_a=(_a*_a)%_m;}return _r;}
    
    ll power(ll _a,ll _b){ll _r=1;while(_b){if(_b%2==1)_r=(_r*_a);_b/=2;_a=(_a*_a);}return _r;}
        
        int n;
        int a,b,c,d;
        int i=0;
        int vis[205][205],p1[205][205],aa[205][205];
        int ci[]={-1,1,2,1,-1,-2};
        int r[]={-2,-2,0,2,2,0};
        string s1[]={"UL", "UR", "R", "LR", "LL", "L"};
        bool valid(int x,int y)
        {
            if(x<0 || y<0 || x>=n || y>=n)
                return false;
            return true;
        }
        int re(int x,int y)
        {
            int di=0;
            queue<pair<int,pair<int,int> > > q;
            q.push({0,{x,y}});
            while(!q.empty())
            {
               pair<int,pair<int,int> > p =q.front();
               q.pop(); 
               int x=p.s.f;
               int y=p.s.s;
               // cout<<x<<"**"<<y<<"**"<<p.f<<endl;
               if(x==c && y==d)
                    return p.f;
                if(!vis[x][y])
                {
                    vis[x][y]=true;
                    for(int i=0;i<6;i++)
                    {
                        if(valid(x+r[i],y+ci[i]))
                        {
                  //          cout<<x+r[i]<<"--"<<y+ci[i]<<endl;
                            if((p.f+1)<p1[x+r[i]][y+ci[i]])
                            {
                                p1[x+r[i]][y+ci[i]]=p.f+1;
                                aa[x+r[i]][y+ci[i]]=i;
                            }
                            q.push({p.f+1,{x+r[i],y+ci[i]}});
                        }
                    }
                }
            }

            return INT_MAX;
        }

    
        int main()
        {
            std::ios_base::sync_with_stdio(false);
            int w=0;
            if(w)
            {
                freopen("C:/Users/gold/Desktop/sublime IO/input.txt","r",stdin);
                freopen("C:/Users/gold/Desktop/sublime IO/output.txt","w",stdout);
            }
          
            cin>>n;
            cin>>a>>b>>c>>d;
            for(int i=0;i<205;i++)
                for(int j=0;j<205;j++)
                {
                    vis[i][j]=0;
                    p1[i][j]=1000009;
                    aa[i][j]=-1;
                }
            
            int ans=re(a,b);
            /*for(int i=0;i<n;i++)
            {
                for(int j=0;j<n;j++)
                    cout<<aa[i][j]<<" ";
                cout<<endl;
            }
          */
            if(ans==INT_MAX)
                cout<<"Impossible\n";
            else
            {
                cout<<ans<<endl;
                stack<int> s;
               // cout<<aa[c][d]<<" "<<c<<" "<<d<<endl;
                s.push(aa[c][d]);
                while(c!=a || d!=b)
                {
                  //  cout<<"***\n";
                   // cout<<c<<".."<<d<<endl;
                    if(aa[c][d]==0)
                    {
                        d=d+1;
                        c=c+2;
                        s.push(aa[c][d]);
                    }
                    else if(aa[c][d]==1)
                    {
                        d=d-1;
                        c=c+2;
                        s.push(aa[c][d]);
                    }
                    else if(aa[c][d]==2)
                    {
                        c=c;
                        d=d-2;
                        s.push(aa[c][d]);
                    }
                    else if(aa[c][d]==3)
                    {
                        d=d-1;
                       c=c-2;
                        s.push(aa[c][d]);
                    }
                    else if(aa[c][d]==4)
                    {
                        d=d+1;
                        c=c-2;
                        s.push(aa[c][d]);
                    }
                    else if(aa[c][d]==5)
                    {
                        c=c;
                        d=d+2;
                        s.push(aa[c][d]);
                    }
                    
                }
                //cout<<endl;
                //cout<<s.size()<<"*/*/*/"<<endl;
                s.pop();
                while(!s.empty())
                {
                   
                    cout<<s1[s.top()]<<" ";
                    s.pop();
                }
                cout<<endl;
            }
            return 0;
        }