#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std; 
#define ll long long int
#define dbl double
#define si set<ll>
#define vi vector<int>
#define vs vector<string>
#define vii vector<vi>
#define vll vector<ll>
#define vdbl vector<dbl>
#define mii map<int,int>
#define pii pair<int,int>
#define pff pair<double,double>
#define fr(i,n) for(int i=0;i<n;i++)
int mymin(vll v)
{
    return *min_element(v.begin(),v.end());
}
ll mymax(vll v)
{
    return *max_element(v.begin(),v.end());
}
ll power(ll a, ll b, ll p)
{
    ll res = 1;
    a %= p;
    while(b!=0)
    {
        if(b%2)
            res = (res%p*a%p)%p;
        b /= 2;
        a = (a%p*a%p)%p;
    }
    return res;
}
vector<string> split(string str,char delimeter)
{
    vector<string> res;
    istringstream iss(str);
    string token;
    while(getline(iss,token,delimeter))
    {
        if(token.length()>0)
        res.push_back(token);
    }
    return res;
}
void randomize (vi &arr)
{
    srand (time(NULL));
    for (int i = arr.size()-1; i > 0; i--)
    {
        int j = rand() % (i+1);
        swap(arr[i], arr[j]);
    }
}
#define mxx 200
#define sqmxx 317
#define mmm INT_MAX
#define mymod 1000000000
#define pcal 1e-19
#define pi 3.1415926535897932384
bool is_visited[mxx][mxx];
int parent[mxx][mxx];
int show_value[mxx*mxx];
int n,x2,y2;
bool is_valid(int x,int y)
{
    if(x>=0 && x<n)
        if(y>=0 && y<n)
            return 1;
    return 0;
}
string str_val[6] = {"UL","UR","R","LR","LL","L"};
int dx[6] = {-2,-2,0,2,2,0};
int dy[6] = {-1,1,2,1,-1,-2};
void bfs(int x1,int y1)
{
    queue<int> q;
    q.push(x1*n+y1);
    is_visited[x1][y1] = 1;
    while(!q.empty())
    {
        int val  = q.front();
        q.pop();
        int x3 = val/n;
        int y3 = val%n;
        if(x3==x2 && y3==y2)
            return;
        //cout<<x3<<","<<y3<<"  -> ";
        fr(i,6)
        {
            int x = x3+dx[i];
            int y = y3+dy[i];
            if(is_valid(x,y) && !is_visited[x][y])
            {
               // cout<<x<<","<<y<<" ";
                q.push(x*n+y);
                parent[x][y] = x3*n+y3;
                show_value[x*n+y] = i;
                is_visited[x][y] = 1;
            }
        }
        //cout<<"\n";
    }
}
int main()
{
    clock_t tstart = clock();
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    //cout<<fixed<<setprecision(17);
    //srand ( time(NULL) );
    int x1,y1;
    cin>>n>>x1>>y1>>x2>>y2;
    //x1--;y1--;x2--;y2--;
    memset(is_visited,0,sizeof is_visited);
    bfs(x1,y1);
    if(!is_visited[x2][y2])
        cout<<"Impossible";
    else
    {
        vi v;
        int i = x2,j=y2;
        while(i*n+j != x1*n+y1)
        {
            //cout<<i<<","<<j<<" ";
            v.push_back(show_value[i*n+j]);
            int val = parent[i][j];
            i = val/n;
            j = val%n;
        }
        int sz = v.size();
        cout<<sz<<"\n";
        fr(i,sz)
        cout<<str_val[v[sz-1-i]]<<" ";
    }
    //cout<<"\n\nTotal Time Taken : "<<(double)(-tstart + clock())/CLOCKS_PER_SEC<<"sec\n\n";
    return 0;
}