#include<iostream>
#include<bits/stdc++.h>
// iteration and input/output stream
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(end) i = begin; i != end; i++)
#define si(x) int x; scanf("%d", &x)
#define sll(x) ll x; scanf("%lld", &x)
#define pi(x) printf("%d", x)
#define pll(x) printf("%lld", x)
#define nl prinf("\n")
#define tr(cont,it) \
for(typeof(cont.begin()) it = cont.begin(); it!= cont.end() ; it++)

#define tc() int t; cin >> t ; while (t--)
//STL shortcuts
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define F first
#define S second
#define MP make_pair

// Error detection
#define trace1(x)                cerr<<#x<<": "<<x<<endl
#define trace2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e)    cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl

using namespace std;

typedef long long int ll; // 64 bit integer
typedef unsigned long long int  ull; // 64 bit unsigned integer
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<int,ll> pill;

inline void smax(int &x , int y) { x = max(x , y) ; }
inline void smin(int &x , int y) { x = min(x , y) ; }
int x1,yi,x2,y2;
int n;
vector<vi> d,vis;
vector<vi> pre;
int check(int x,int y,int m)
{
    if(m==0)
    {
        if(x-2>=0 && y-1>=0)
        {
            if(!vis[x-2][y-1])
            { vis[x-2][y-1]=1; d[x-2][y-1]= d[x][y]+1; pre[x-2][y-1] = 0; return 1;}
            return 0;
        }
        return 0;
    }
    else if(m==1)
    {
        if(x-2>=0 && y+1<n)
        {
            if(!vis[x-2][y+1])
            { vis[x-2][y+1]=1; d[x-2][y+1]=d[x][y]+1; pre[x-2][y+1]=1; return 1;}
            return 0;
        }
        return 0;
    }
    else if(m==2)
    {
        if(y+2<n)
        {
            if(!vis[x][y+2])
            { vis[x][y+2]=1; d[x][y+2]=d[x][y]+1; pre[x][y+2]= 2; return 1;}
            return 0;
        }
        return 0;
    }
    else if(m==3)
    {
        if(x+2<n && y+1<n)
        {
            if(!vis[x+2][y+1])
            { vis[x+2][y+1]=1; d[x+2][y+1]=d[x][y]+1; pre[x+2][y+1]=3; return 1;}
            return 0;
        }
        return 0;
    }
    else if(m==4)
    {
        if(x+2<n && y-1>=0)
        {
            if(!vis[x+2][y-1])
            { vis[x+2][y-1]=1; d[x+2][y-1] = d[x][y]+1; pre[x+2][y-1]=4; return 1;}
            return 0;
        }
        return 0;
    }
    else
    {
        if(y-2>=0)
        {
            if(!vis[x][y-2])
            { vis[x][y-2]=1; d[x][y-2]= d[x][y]+1; pre[x][y-2] = 5;  return 1;}
            return 0;
        }
        return 0;
    }
}


void bfs()
{
    pre[x1][yi] = -1;
    deque<pii> pend;
    pend.pb(MP(x1,yi));
    while(!pend.empty())
    {
        int x = pend.front().F;
        int y = pend.front().S;
        if(x==x2 && y==y2)
            break;
        pend.pof();
        rep(i,0,6)
        {
            if(check(x,y,i)==1)
            {
                if(i==0)
                    pend.pb(MP(x-2,y-1));
                else if(i==1)
                    pend.pb(MP(x-2,y+1));
                else if(i==2)
                    pend.pb(MP(x,y+2));
                else if(i==3)
                    pend.pb(MP(x+2,y+1));
                else if(i==4)
                    pend.pb(MP(x+2,y-1));
                else
                    pend.pb(MP(x,y-2));
            }
        }
    }
}
int main()
{
    cin>>n;
    cin>>x1>>yi>>x2>>y2;
    d.resize(n,vi(n));
    vis.resize(n,vi(n));
    pre.resize(n,vi(n));
    if(abs(x1-x2)%2==1)
    {
        cout<<"Impossible"<<endl;
        exit(0);
    }
    else
    {
        if((abs(x1-x2)/2)%2==0)
        {
            if(abs(yi-y2)%2==1)
            {
                cout<<"Impossible"<<endl;
                exit(0);
            }
        }
        else
        {
            if(abs(yi-y2)%2==0)
            {
                cout<<"Impossible"<<endl;
                exit(0);
            }
        }
    }

    /*while(x1!=x2 || yi!=y2)
    {
        rep(i,0,6)
        {
            if(check(x1,yi,i)==1)
            {
                modify(i);
                break;
            }
        }
    }*/
    bfs();

    vector<string> sol;
    int x = x2,y=y2;
    while(x!= x1 || y!= yi)
    {
        if(pre[x][y]==0)
        {
            x+= 2;
            y+= 1;
            sol.pb("UL");
        }
        else if(pre[x][y]==1)
        {
            x+= 2;
            y-= 1;
            sol.pb("UR");
        }
        else if(pre[x][y]==2)
        {
            y-= 2;
            sol.pb("R");
        }
        else if(pre[x][y]==3)
        {
            x-=2;
            y-=1;
            sol.pb("LR");
        }
        else if(pre[x][y]==4)
        {
            x-=2;
            y+=1;
            sol.pb("LL");
        }
        else if(pre[x][y]==5)
        {
            y+=2;
            sol.pb("L");
        }
    }
    cout<<sol.size()<<endl;
    for(int i=sol.size()-1;i>=0;i--)
    {
        cout<<sol[i]<<" ";
    }
    cout<<endl;

}