#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define prArr(a) {cerr<<(#a)<<"={";int i=0;for(auto t:(a))cerr<<(i++?", ":"")<<t;cerr<<"}"<<endl;}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
Int m = 32;
vector<Int> d(m);

string solve(Int x,Int y){
  string res;
  Int fa = (x + y) < 0? -1:1;
  Int fb = (x - y) < 0? -1:1;
  Int u = abs(x + y), v = abs(x - y);
  
  auto getCmd = [](Int a,Int b){
    if(a == -1 && b == -1) return 'L';
    if(a == 1 && b == 1) return 'R';
    if(a == -1 && b == 1) return 'D';
    if(a == 1 && b == -1) return 'U';
    assert(0);
  };

  Int M = 0;
  for(Int i=0;i<m;i++) M += d[i];
  if(d[0] == 1 && d[1] == 1) M--;
  for(Int i=0;i<m;i++){
    Int a = fa, b = fb;
    if((M - u) & d[i+1]) a *= -1;
    if((M - v) & d[i+1]) b *= -1;
    res += getCmd(a, b);
  }
  //res += getCmd(fa, fb);
  return res;
}

void check(Int targetX,Int targetY, string cmd){
  assert((Int)cmd.size() == m);
  Int x = 0, y = 0;
  for(Int i=0;i<m;i++){
    if(cmd[i] == 'L') x -= d[i];
    if(cmd[i] == 'R') x += d[i];
    if(cmd[i] == 'D') y -= d[i];
    if(cmd[i] == 'U') y += d[i];
  }
  //pr(cmd);
  //pr(d);
  //pr(targetX, targetY, x, y);
  assert(x == targetX && y == targetY);
}

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  
  Int n;
  cin>>n;
  vector<Int>X(n), Y(n);
  for(Int i=0;i<n;i++) cin>>X[i]>>Y[i];
  Int mod[2] = {};
  for(Int i=0;i<n;i++) mod[ abs(X[i] + Y[i]) % 2 ] = 1;
    
  if(mod[0] && mod[1]){
    cout<<-1<<endl;
    return 0;
  }
  
  for(Int i=0;i<m;i++) d[i] = 1LL<<i;
  if(mod[0]) d.insert(d.begin(), 1);
  m = d.size();
  
  vector<string> Ans;
  for(Int i=0;i<n;i++){
    string str = solve(X[i], Y[i]);
    check(X[i], Y[i], str);
    Ans.push_back(str);
  }
  
  cout<<m<<endl;
  cout<<d<<endl;
  for(auto ans:Ans) cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 384