#include <bits/stdc++.h>

using namespace std;

using ll = long long;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
char ch[4] = {'R', 'L', 'U', 'D'};

int main(){
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  cout.setf(ios::fixed); cout.precision(17);
  int n;
  cin >> n;
  vector<long long> x(n), y(n);
  for(int i = 0; i < n; i++){
    cin >> x[i] >> y[i];
  }
  for(int i = 1; i < n; i++){
    if(((x[0] + y[0]) & 1) != ((x[i] + y[i]) & 1)){
      cout << "-1\n";
      return 0;
    }
  }
  vector<long long> moves;
  for(int i = 30; i >= 0; i--){
    moves.push_back((1<<i));
  }
  if((x[0] + y[0]) % 2 == 0){ // same parity throws an even lenght, so add +1 to 1,2,4,...
    moves.push_back(1);
  }
  cout << moves.size() << "\n";
  for(int i = 0; i < moves.size(); i++){
    cout << moves[i] << " ";
  } cout << "\n";
  for(int i = 0; i < n; i++){
    string seq = "";
    ll xx = 0, yy = 0;
    for(int k = 0; k < moves.size(); k++){
      ll _min = 1e11;
      int at = -1;
      for(int j = 0; j < 4; j++){
        ll dist = abs( moves[k] * dx[j] - x[i]) + abs( moves[k]* dy[j] - y[i]);
        if(dist < _min){
          _min = dist;
          at = j;
        }
      }
      seq += ch[at];
      xx += moves[k] * dx[at];
      yy += moves[k] * dy[at];
      x[i] -= moves[k] * dx[at];  // now the origin is at (moves[at]*dx[at], moves[at]*dy[at])
      y[i] -= moves[k] * dy[at];  // i.e. (-4,0), so x and y must shifft.
    }
    //cout << xx << " " << yy << "\n";
    cout << seq << "\n";
  }
  return 0;
}
