//Created Time:2020年03月19日 星期四 14时11分16秒
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define N 1003

using namespace std;

int n;
int x[N], y[N];

int main(){
	scanf("%d", &n); bool flag;
	for(int i = 1; i <= n; ++i){
		scanf("%d%d", x + i, y + i);
		if(i == 1) flag = abs(x[i]) + abs(y[i]) & 1;
		else if((abs(x[i]) + abs(y[i]) & 1) != flag) return puts("-1"), 0;
	}
	int m = 31;
	cout << m + (!flag) << endl;
	for(int i = 0; i < m; ++i) cout << (1ll << m - i - 1) << ' ';
	if(!flag) cout << 1; cout << endl;
	for(int i = 1; i <= n; ++i){
		long long nx = 0, ny = 0;
		if(!flag) --x[i];
		for(int j = 0; j < m; ++j){
			long long tmp, d = 1 << m - 1 - j, mn = 2147483647;
			if(abs(nx + d - x[i]) + abs(ny - y[i]) < mn)
				mn = abs(nx + d - x[i]) + abs(ny - y[i]), tmp = 0;
			if(abs(nx - d - x[i]) + abs(ny - y[i]) < mn)
				mn = abs(nx - d - x[i]) + abs(ny - y[i]), tmp = 1;
			if(abs(nx - x[i]) + abs(ny + d - y[i]) < mn)
				mn = abs(nx - x[i]) + abs(ny + d - y[i]), tmp = 2;
			if(abs(nx - x[i]) + abs(ny - d - y[i]) < mn)
				mn = abs(nx - x[i]) + abs(ny - d - y[i]), tmp = 3;
			switch(tmp){
				case 0:
					nx += d, putchar('R'); break;
				case 1:
					nx -= d, putchar('L'); break;
				case 2:
					ny += d, putchar('U'); break;
				case 3:
					ny -= d, putchar('D'); break;
			}
		}
		if(!flag) putchar('R'); putchar('\n');
//		cout << nx << ' ' << ny << endl;
	}
	return 0;
}