//aneesh bose #include using namespace std; const int N=1234567; int a[N]; bool visited[N]; #define loop(i,n) for(int i=0;i=0;i--) #define all(x) (x).begin(),(x).end() #define sz(x) (int)(x).size() #define fi first #define se second #define mp make_pair #define pb push_back #define yolo "debug_statement" typedef unsigned long long ull; typedef long long ll; typedef long double ld; typedef pair pii; typedef vector vpii; typedef vector vi; const ll inf = 1e9; const ld eps = 1e-9; const ld pi=acos(-1); const ll mod=1000000007; ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;} /*void dfs(int source){ visited[source] = true; for(auto it: adj[source]) if(!visited[it]) dfs(it); }*/ int main(){ ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL); int mn=0; int n; cin>>n; int sr,sc,dr,dc; cin>>sr>>sc>>dr>>dc; string ans=""; int ogr,ogc; ogr=sr;ogc=sc; bool done=false; int moves=0; //cout<dr && sc>dc) { if(sr-2>=dr && sc-1>=dc) { ans+="UL "; //cout<dr && sc=dr && sc+1<=dc) { ans+="UR "; sr-=2; sc+=1; ogr-=2; ogc+=1; moves++; } if(sr-2<0 || sc+1>=n) break; } //cout<=n || sc+1>=n || sr+2>dr) break; } //cout<dc && sr=dc && sr+2<=dr) { ans+="LL "; sc-=1; sr+=2; ogc-=1;ogr+=2; moves++; } if(sr+2>=n || sr+2>dr || sc-1<0) break; } //cout<dc) { if(sc-2>=dc) { ans+="L "; sc-=2; moves++; } else break; } if(sr==dr && sc==dc) done=true; if(ogc==dc && abs(ogr-dr)%4==0 && dr>sr) { cout<