#include using namespace std; using VI = vector; using VVI = vector; using PII = pair; using LL = long long; using VL = vector; using VVL = vector; using PLL = pair; using VS = vector; #define ALL(a) begin((a)),end((a)) #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define EB emplace_back #define MP make_pair #define SZ(a) int((a).size()) #define SORT(c) sort(ALL((c))) #define RSORT(c) sort(RALL((c))) #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define FF first #define SS second template istream& operator>>(istream& is, pair& p){ return is >> p.FF >> p.SS; } template ostream& operator<<(ostream& os, const pair& p){ return os << p.FF << " " << p.SS; } template void maxi(T& x, T y){ if(x < y) x = y; } template void mini(T& x, T y){ if(x > y) x = y; } const double EPS = 1e-10; const double PI = acos(-1.0); const LL MOD = 1e9+7; int main(){ cin.tie(0); ios_base::sync_with_stdio(false); int N; cin >> N; int sy, sx, ey, ex; cin >> sy >> sx >> ey >> ex; vector ans; while(ey <= sy-2 && sy-2 >= 0){ sy -= 2; if(sx == N-1 || (ex <= sx && sx-1 >= 0)){ ans.EB("UL"); --sx; } else{ ans.EB("UR"); ++sx; } } while(sy+2 <= ey && sy+2 < N){ sy += 2; if(sx == 0 || (sx <= ex && sx+1 < N)){ ans.EB("LR"); ++sx; } else{ ans.EB("LL"); --sx; } } if(sy != ey){ cout << "Impossible" << endl; return 0; } while(ex <= sx-2 && sx-2 >= 0){ ans.EB("L"); sx -= 2; } while(sx+2 <= ex && sx+2 < N){ ans.EB("R"); sx += 2; } if(sx == ex && sy == ey){ cout << SZ(ans) << endl; map ix; ix["UL"] = 0; ix["UR"] = 1; ix["R"] = 2; ix["LR"] = 3; ix["LL"] = 4; ix["L"] = 5; sort(ALL(ans), [&ix](const string& l, const string& r){ return ix[l] < ix[r]; }); REP(i,SZ(ans)){ cout << (i?" ":"") << ans[i]; } cout << endl; } else{ cout << "Impossible" << endl; } return 0; }