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

/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/

#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))

//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
  sort(ALL(c)); \
  for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))

// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;

// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountll((a))

//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

//constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 1, 0, 0};
constexpr int dy[] = {0, 0, -1, 1};

//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
} Accelerate_Cin;

int N;
vector<int> x, y;

signed main() {
  cin >> N;
  int par;
  for (int i = 0; i < N; i++) {
    int a, b;
    cin >> a >> b;
    x.push_back(a);
    y.push_back(b);
    if (i == 0) {
      par = (abs(a) + abs(b)) % 2;
    } else {
      if (par != (abs(a) + abs(b)) % 2) {
        cout << -1 << endl;
        return 0;
      }
    }
  }

  vector<int> l;
  for (int i = 35; i >= 0; i--) {
    l.push_back(pow(2, i));
  }
  if (par % 2 == 0) {
    l.push_back(1);
  }
  cout << l.size() << endl;
  for (int i = 0; i < l.size(); i++) {
    if (i != 0) {
      cout << " ";
    }
    cout << l[i];
  }

  cout << endl;

  char c[] = {'L', 'R', 'D', 'U'};
  for (int i = 0; i < N; i++) {
    int nx = x[i], ny = y[i];
    int xx = 0, yy = 0;
    for (auto x : l) {
      int ans = INF;
      int ii = 0;
      for (int j = 0; j < 4; j++) {
        int tx = xx + dx[j] * x, ty = yy + dy[j] * x;
        int tmp = abs(nx - tx) + abs(ny - ty);
        if (ans > tmp) {
          ans = tmp;
          ii = j;
        }
      }
      cout << c[ii];
      xx += dx[ii] * x;
      yy += dy[ii] * x;
    }
    cout << endl;
  }
  return 0;
}


Measured memory_bytes: 384