#include <bits/stdc++.h>
const int N = 1e3 + 5;
int n, a;
long long x[N], y[N], bin[33];
inline void shu(long long x, long long y) {
	for (int i = a - 1; i >= 0; i--) {
		if (std::labs(x) > std::labs(y)) {
			putchar(x < 0 ? 'L' : 'R');
			x < 0 ? x += bin[i] : x -= bin[i];
		} else {
			putchar(y < 0 ? 'D' : 'U');
			y < 0 ? y += bin[i] : y -= bin[i];
		}
	}
	puts("");
}
int main() {
	scanf("%d", &n);
	bool tf = false, tf1 = false;
	for (int i = 1; i <= n; i++) {
		scanf("%lld %lld", &x[i], &y[i]);
		((x[i] + y[i]) & 1 ? tf : tf1) = true;
	}
	if (tf && tf1) return puts("-1"), 0;
	if (tf) {
		printf("%d\n", a = 33);
		for (int i = a - 1; i >= 0; i--) 
			printf("%lld%c", bin[i] = 1LL << i, " \n"[i == 0]);
	} else {
		printf("%d\n", a = 34);
		for (int i = a - 1; i >= 1; i--) 
			printf("%lld ", bin[i] = 1LL << (i - 1));
		printf("%lld\n", bin[0] = 1);
	}
	for (int i = 1; i <= n; i++) shu(x[i], y[i]);
	return 0;
}