#include <bits/stdc++.h>
#define int long long int
#define mod(x) ((x % MOD) + MOD) % MOD
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define RFORE(i,a,b) for(int i=(b);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define SZ(c) (int)((c).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define LB(c,x) (int)(lower_bound(ALL(c),x)-(c).begin())
#define UB(c,x) (int)(upper_bound(ALL(c),x)-(c).begin())
#define COUNT(c,x) (UB(c,x)-LB(c,x))
#define UNIQUE(c) SORT(c); (c).erase(unique(ALL(c)),(c).end());
#define COPY(c1,c2) copy(ALL(c1),(c2).begin())
#define EXIST(s,e) (bool)((s).find(e)!=(s).end())
#define PB push_back
#define MP make_pair
#define DEL(v) decltype(v)().swap(v)
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define NL cerr << endl;
#define chmax(a, b) a=(((a)<(b))?(b):(a))
#define chmin(a, b) a=(((a)>(b))?(b):(a))
#define F first
#define S second
using namespace std;
template<typename T1, typename T2> using P = pair<T1,T2>;
template<typename T> using V = vector<T>;
struct edge { int from, to; int cost; };
bool operator< (const edge &edge1, const edge &edge2) { return edge1.cost < edge2.cost; };
const int INF = 1e18;
const int MOD = 1e9+7;

template<typename T> ostream& operator << (ostream& s, const V<T>& v) {
   s << "[";
   for (int i = 0; i < v.size(); i++) { s << v[i]; if (i < v.size() - 1) s << " "; }
   s << "]";
   return s;
}
template<typename T1, typename T2> ostream& operator << (ostream& s, const P<T1,T2>& p) {
   s << "(" << p.first << "," << p.second << ")";
   return s;
}
template<typename T> ostream& operator << (ostream& s, const set<T>& st) {
   s << "{";
   for (auto i = st.begin(); i != st.end(); ++i) {
      s << *i;
      if (next(i) != st.end()) s << ", ";
   }
   s << "}";
   return s;
}
template<typename T1, typename T2> ostream& operator << (ostream& s, const map<T1,T2>& m) {
   s << "{";
   for (auto i = m.begin(); i != m.end(); ++i) {
      s << i->first << ":" << i->second;
      if (next(i) != m.end()) s << ", ";
   }
   s << "}";
   return s;
}

int power(int x, int n) {
   int res = 1;
   while (n > 0) {
      if ((n & 1) == 1) res *= x;
      x *= x;
      n >>= 1;
   }
   return res;
}

signed main()
{
   int N; cin >> N;
   V<int> X(N), Y(N);
   REP(i, N) {
      cin >> X[i] >> Y[i];
   }

   const int MAX_K = 31;
   V<int> u(N), v(N);
   REP(i, N) {
      u[i] = X[i] + Y[i] + power(2,MAX_K) - 1;
      v[i] = X[i] - Y[i] + power(2,MAX_K) - 1;
   }
   DUMP(u)
   DUMP(v)
   REP(i, N) {
      if ((u[i] - u[0]) % 2 != 0) {
         cout << -1 << endl; return 0;
      }
   }

   V<int> d;
   if (u[0] % 2 == 1) {
      d.PB(1);
   }
   FOR(k, 0, MAX_K) {
      d.PB(power(2,k));
   }

   V<string> w(N);
   REP(i, N) {
      if (u[0] % 2 == 1) {
         w[i] += "R";
      }
      FORE(k, 1, MAX_K) {
         bool u_ = u[i] >> k & 1;
         bool v_ = v[i] >> k & 1;
         if (u_ && v_) {
            w[i] += "R";
         } else if (u_ && !v_) {
            w[i] += "U";
         } else if (!u_ && v_) {
            w[i] += "D";
         } else {
            w[i] += "L";
         }
      }
   }

   cout << d.size() << endl;
   REP(i, d.size()) {
      cout << d[i] << " ";
   }
   cout << endl;
   REP(i, N) {
      cout << w[i] << endl;
   }

   return 0;
}


Measured memory_bytes: 384