#include #include #include #include #include #include #include int curr_i,curr_j; void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) { int sum0=0,sum1=0,sum2=0,sum3=0,sum4=0,sum6=0; while(curr_i>i_end+1&&curr_j>j_end){ if(curr_j!=0&&curr_i>1){curr_j--;curr_i--;curr_i--;} sum0++;} while(curr_i>i_end+1&&curr_j1){curr_j++;curr_i--;curr_i--;} sum1++; } while(curr_i==i_end&&curr_jj_end){ if(curr_j>0&&curr_ij_end-1){ if(curr_j>1){curr_j--;curr_j--;} sum6++; } if(curr_i==i_end&&curr_j==j_end){ printf("%d\n",sum0+sum1+sum2+sum3+sum4+sum6); while(sum0--) printf("UL "); while(sum1--) printf("UR "); while(sum2--) printf("R "); while(sum3--) printf("LR "); while(sum4--) printf("LL "); while(sum6--) printf("L "); } else printf("Impossible"); } int main() { int n; scanf("%i", &n); int i_start; int j_start; int i_end; int j_end; scanf("%i %i %i %i", &i_start, &j_start, &i_end, &j_end); curr_i=i_start; curr_j=j_start; printShortestPath(n, i_start, j_start, i_end, j_end); return 0; }