#include<bits/stdc++.h>
using namespace std;
int y[]={-1,1,2,1,-1,-2};
int x[]={-2,-2,0,2,2,0};
bool vis[201][201];
int dist[201][201];
string s[]={"UL","UR","R","LR","LL","L"};

void bfs(int sx,int sy,int ex,int ey,int n)
{
    queue<pair<vector<int> ,pair<int,int> > > q;
    vector<int> v1;
    q.push({v1,{sx,sy}});
    vis[sx][sy]=true;
    dist[sx][sy]=0; 
	bool f=0;  
    while(!q.empty())
    {
        v1=q.front().first;
        pair<int,int> p=q.front().second;
        int x1=p.first;
        int y1=p.second;
        q.pop();
        if(x1==ex && y1==ey)
        {   
			cout<<v1.size()<<endl;        
            for(int i=0;i<v1.size();i++)
			{
				cout<<s[v1[i]]<<" ";				
			}
			f=1;
			break;
						            
        }
        for(int i=0;i<6;i++)
        {
            int nx=x1+x[i];
            int ny=y1+y[i];
            if(nx>=0 && ny>=0 && nx<n && ny<n && !vis[nx][ny])
            {
                                
                vis[nx][ny]=true;
                vector<int> v2(v1);
                v2.push_back(i);
                q.push({v2,{nx,ny}});
            }
        }
        
    }
    	if(!f)
        cout<<"Impossible";
}
int main()
{
    int n;
    cin>>n;
    int sx,sy,ex,ey;
    cin>>sx>>sy>>ex>>ey;
    memset(vis,false,sizeof(vis));    
    bfs(sx,sy,ex,ey,n);
    
}