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

int main() {

  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> x(n);
  vector<int> y(n);
  for (int i=0;i<n;i++) cin >> x[i] >> y[i];
  bool odd = true;
  bool even = true;
  for (int i=0;i<n;i++) {
    if ((abs(x[i])+abs(y[i]))%2 == 0) {
      odd = false;
    }
    else {
      even = false;
    }
  } 
  if (!odd && !even) {
    cout << -1 << endl;
  } 
  else {
    vector<long long> arms(33,1);
    vector<long long> sums(33,0);
    if (odd) {
      for (int i=31;i>=0;i--) {
        arms[i] = arms[i+1]*2;
        sums[i] = sums[i+1]+arms[i+1];
      }
    }
    if (even) {
      sums[31] = 1;
      for (int i=30;i>=0;i--) {
        arms[i] = arms[i+1]*2;
        sums[i] = sums[i+1]+arms[i+1];
      } 
    } 
    cout << 33 << endl;
    for (int i=0;i<33;i++) {
      if (i != 0) cout << ' ';
      cout << arms[i];
    }
    cout << endl;
    vector<int> dx={0,1,0,-1};
    vector<int> dy={1,0,-1,0};
    vector<char> dir={'D','L','U','R'};
    for (int i=0;i<n;i++) {
      long long nx = x[i];
      long long ny = y[i];
      for (int j=0;j<33;j++) {
        for (int k=0;k<4;k++) {
          long long tox = nx+arms[j]*dx[k];
          long long toy = ny+arms[j]*dy[k];
          if(abs(tox)+abs(toy) <= sums[j]) {
            cout << dir[k];
            nx = tox;
            ny = toy;
            break;
          }
        }
      }
      cout << endl;
    }
  }
  
}