#include <iostream>
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <numeric>
#include <functional>
#include <array>
using namespace std;

using pll = pair<long long, long long>;

int main() {
	int N; cin >> N;
	vector<pll> pos(N);
	int par;
	for (int i = 0; i < N; ++i) {
		cin >> pos[i].first >> pos[i].second;
		if (i == 0)par = (abs(pos[0].first) + abs(pos[0].second)) % 2;
		else if(par != ((abs(pos[i].first) + abs(pos[i].second)) % 2)){
			cout << -1; return 0;
		}
	}
		
	vector<long long>deg;
	for (int i = 30; 0 <= i; --i)deg.push_back(1LL << i);
	if (!par)deg.push_back(1);
	cout << deg.size() << endl;
	for (int i = 0; i < deg.size(); ++i)cout << deg[i] << " ";
	cout << endl;

	constexpr array<long long, 4> dx = { -1, +1, 0, 0 };
	constexpr array<long long, 4> dy = { 0, 0, -1, +1 };

	for (int i = 0; i < N;++i) {
		long currentX = 0;
		long currentY = 0;
		string dirLetter = "LRDU";
		for (auto&& d : deg) {
			int dl = 0;
			long long maxDistance = numeric_limits<long long>::max();
			for (int j = 0; j < 4;++j) {
				long nextX = currentX + d * dx[j];
				long nextY = currentY + d * dy[j];
				long distance = abs(nextX-pos[i].first) + abs(nextY-pos[i].second);
				if (distance < maxDistance) {
					maxDistance = distance;
					dl = j;
				}
			}
			cout << dirLetter[dl];
			currentX += d * dx[dl];
			currentY += d * dy[dl];
		}
		cout << endl;
	}
}
