// template version 1.2
using namespace std;
#include <iostream>
#include <bits/stdc++.h>

#define infile "../test/sample-1.in"
#define int long long
// #define INF 2147483647
#define INF 1000000000000000000LL
#define MOD 1000000007LL

// {{{ define basic macro
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)

#define foreach(x,a) for(auto& (x) : (a) )
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)

#define all(x) (x).begin(),(x).end()
#define sum(v) accumulate(all(v), 0LL)
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ten(n) ((int)1e##n)

template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }

template<typename A, size_t N, typename T> // n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}

template <class T = int>
T in() {T x; cin>>x; return (x);}

struct Fast {
  Fast(){
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
// }}}
//{{{ dump macro
#ifdef PCM
  #include "dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}
//{{{ others
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
//}}}


int solve(){
  int n;cin>>n;

  int x[n]={};
  int y[n]={};
  int p=0; int q=0;
  rep(i, n){
    cin>>x[i]>>y[i];
    if ((x[i]+y[i])%2==0) p++;
    if ((x[i]+y[i])%2!=0) q++;
  }
  if (p*q!=0) {
    cout << -1 << endl;
    return 0;
  }

  int m = (p>0 ? 32 : 31);
  cout << m << endl;

  int d[31];
  d[0] = 1;
  rep(i, 1, 31){ d[i] = d[i-1]*2; }
  reverse(d, d+31);

  if (p>0) {
    cout << "1 ";
  }
  rep(i, 31) cout << d[i] << (i!=31-1 ? " " : "\n");

  rep(i, n){
    string res = "";
    int s = x[i]-y[i];
    int t = x[i]+y[i];
    if (p>0){
      s--;t--;
      res = "R";
    }

    rep(j, 31){
      if (s>0 and t>0) {
        s -= d[j];
        t -= d[j];
        res += "R";
      }
      else if (s>0 and t<0) {
        s -= d[j];
        t += d[j];
        res += "D";
      }
      else if (s<0 and t>0) {
        s += d[j];
        t -= d[j];
        res += "U";
      }
      else if (s<0 and t<0) {
        s += d[j];
        t += d[j];
        res += "L";
      }
    }
    dump(s,t);
    cout << res << endl;
  }

  return 0;
}

int test(){ //{{{
  return 0;
}
//}}}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
#ifdef PCM
  test();
#endif
  solve();
  return 0;
} //}}}


Measured memory_bytes: 256