#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const int inf = 1e9 + 7;
const ll INF = 1e18;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T> T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { for (auto &vi: vec) os << vi << " "; return os; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<typename T >inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T> inline void add(T &a, int b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(10);
    
    int T;
    // cin >> T;
    T = 1;
    
    while (T--) {
        solve();
    }
}

void solve() {
    int n;
    cin >> n;
    vector<ll> x(n), y(n);
    rep(i, n) cin >> x[i] >> y[i];
    
    rep(i, n) {
        int a = (x[i] + y[i]) % 2;
        if (a == -1) a = 1;
        int b = (x[0] + y[0]) % 2;
        if (b == -1) b = 1;
        if (a != b) {
            cout << -1 << endl;
            return;
        }
    }
    
    int k = 31;
    if ((x[0] + y[0]) % 2 == 0) {
        k++;
        cout << k << endl;
        cout << 1 << " ";
        rep(i, n) x[i]--;
    } else cout << k << endl;
    rep(i, 31) cout << pow(2LL, i) << " ";
    cout << endl;
    
    int dy[] = {-1, 0, 1, 0};
    int dx[] = {0, 1, 0, -1};
    
    rep(i, n) {
        string s;
        for (int j = 30; j >= 0; --j) {
            rep(l, 4) {
                ll ny = y[i] + pow(2LL, j) * dy[l];
                ll nx = x[i] + pow(2LL, j) * dx[l];
                if (abs(ny) + abs(nx) <= pow(2LL, j)) {
                    y[i] = ny;
                    x[i] = nx;
                    // cout << l << " " << ny << " " << nx << endl;
                    if (l == 0) s += 'D';
                    else if (l == 1) s += 'R';
                    else if (l == 2) s += 'U';
                    else s += 'L';
                    break;
                }
            }
        }
        // cout << endl << s << endl;
        // cout << y[i] << " " << x[i] << endl;
        
        // 1, 2, ... の順で足すのに変える
        reverse(all(s));
        // 向き逆に
        rep(j, sz(s)) {
            if (s[j] == 'L') s[j] = 'R';
            else if (s[j] == 'R') s[j] = 'L';
            else if (s[j] == 'U') s[j] = 'D';
            else s[j] = 'U';
        }
        
        if (k == 32) s = 'R' + s;
        
        cout << s << endl;
        
        ll ny = 0, nx = 0;
        if (k == 32) nx++;
        // cout << nx << " " << ny << endl;
        rep(j, 31) {
            char t;
            if (k == 31) t = s[j];
            else t = s[j + 1];
            
            if (t == 'L') nx -= pow(2LL, j);
            else if (t == 'R') nx += pow(2LL, j);
            else if (t == 'U') ny += pow(2LL, j);
            else ny -= pow(2LL, j);
        }
        // cout << nx << " " << ny << endl; // nx, ny の順
    }
}



Measured memory_bytes: 256