#define MOD_TYPE 1

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

inline void init_main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

void solve()
{
  int n;
  cin >> n;
  vector<int> x(n), y(n);
  bool b[2] = {};
  rep(i, n)
  {
    cin >> x[i] >> y[i];
    b[(x[i] + y[i]) % 2] = true;
  }
  if (b[0] and b[1])
  {
    cout << -1 << "\n";
    return;
  }
  vector<ll> d;
  bool adj = false;
  if (b[0])
  {
    adj = true;
    d.push_back(1);
    rep(i, n) x[i]++;
  }
  rep(i, 35) d.push_back(1LL << i);
  cout << d.size() << "\n";
  rep(i, d.size()) cout << d[i] << (i + 1 == d.size() ? "\n" : " ");

  ll s = (1LL << 35) - 1;
  auto calc = [&](ll x)
  {
    assert((s + x) % 2 == 0);
    ll t = (s + x) / 2;
    vector<int> res;
    rep(i, 35)
    {
      res.push_back(t % 2);
      t >>= 1;
    }
    assert(t == 0);
    return res;
  };

  rep(i, n)
  {
    if (adj)
      cout << "L";
    ll u = x[i] + y[i];
    ll v = x[i] - y[i];
    vector<int> v1 = calc(u);
    vector<int> v2 = calc(v);
    rep(i, 35)
    {
      if (!v1[i] and !v2[i])
        cout << "L";
      if (v1[i] and v2[i])
        cout << "R";
      if (!v1[i] and v2[i])
        cout << "D";
      if (v1[i] and !v2[i])
        cout << "U";
    }
    cout << "\n";
  }
}

int main()
{
  init_main();
  solve();
  return 0;
}


Measured memory_bytes: 3676