#include #include int main() { int i, j, k, N, A[200001], B[200001], ans = 0; scanf("%d", &N); for (i = 1; i <= N; i++) scanf("%d", &(A[i])); for (i = 1; i <= N; i++) scanf("%d", &(B[i])); for (i = 1; i <= N; i++) ans += abs(A[i] - B[i]); printf("%d\n", ans); for (i = 1; i <= N; i++) { k = 0; while (A[i] != B[i]) { if (A[i] > B[i]) { printf("%d L\n", i); A[i]--; } else { if (k == 0) for (j = i; j < N && A[j] == A[j+1] - 1; j++); else j = k; printf("%d R\n", j); A[j]++; if (j > i) k = j - 1; else k = 0; } } } fflush(stdout); return 0; }