#include <bits/stdc++.h>
using namespace std;

int main() {
  int N;
  cin >> N;

  int tmp;
  vector< vector<int> > XY(N);
  for (int i = 0; i < N; i++) {
    cin >> tmp; XY[i].push_back(tmp);
    cin >> tmp; XY[i].push_back(tmp);
  }

  int prevmod, mod;
  prevmod = (XY[0][0] + XY[0][1]) % 2 != 0;
  for (int i = 1; i < N; i++) {
    mod = (XY[i][0] + XY[i][1]) % 2 != 0;
    if (mod != prevmod) {
      cout << -1 << endl;
      return 0;
    }
    prevmod = mod;
  }

  vector<long> D;
  if (mod == 0) {
    D.push_back(1);
  }
  for (int i = 0; i < 32; i++) {
    D.push_back(pow(2, i));
  }
  reverse(D.begin(), D.end());

  int m = D.size();
  cout << m << endl;
  for (int i = 0; i < m - 1; i++) {
    cout << D[i] << ' ';
  }
  cout << D[m - 1] << endl;

  for (int i = 0; i < N; i++) {
    long x = XY[i][0];
    long y = XY[i][1];
    for (int j = 0; j < m; j++) {
      if (0 < x + y && 0 < x - y) {
        cout << 'R';
        x -= D[j];
      } else if (0 < x + y && x - y <= 0) {
        cout << 'U';
        y -= D[j];
      } else if (x + y <= 0 && x - y <= 0) {
        cout << 'L';
        x += D[j];
      } else {
        cout << 'D';
        y += D[j];
      }
    }
    cout << endl;
  }
}