#include <bits/stdc++.h>
using namespace std;

// clang-format off
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define endl '\n'
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod   = 1e9 + 7;
constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

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

struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } 
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// clang-format on

void solver() {
    int N = input();
    vector< i64 > X(N), Y(N);
    range(i, 0, N) {
        cin >> X[i] >> Y[i];
    }

    range(i, 0, N) {
        i64 x = X[i] + Y[i];
        i64 y = X[i] - Y[i];
        X[i] = x;
        Y[i] = y;
    }
    
    range(i, 1, N) {
        if ((X[i - 1] & 1) != (X[i] & 1)) {
            cout << -1 << endl;
            return;
        }
    }

    bool f = !(X[0] & 1);
    
    vector< i64 > d(39, 1);
    range(i, 1, d.size()) d[i] = d[i - 1] * 2;
    if (f) d.push_back(1);
    
    whole(reverse, d);

    cout << d.size() << endl;
    cout << d << endl;
    
    range(i, 0, N) {
        i64 x = X[i];
        i64 y = Y[i];
        string ans;

        if (f) {
            ans += 'L';
            x += 1;
            y += 1;
        }

        range(i, f, d.size()) {
            i64 mv = d[i];
            if (x >= 0 && y >= 0) {
                ans += 'R';
                x -= mv;
                y -= mv;
            } else if (x < 0 && y >= 0) {
                ans += 'D';
                x += mv;
                y -= mv;
            } else if (x >= 0 && y < 0) {
                ans += 'U';
                x -= mv;
                y += mv;
            } else {
                ans += 'L';
                x += mv;
                y += mv;
            }
        }
        
        cout << ans << endl;
    }
}

signed main(int argc, char *argv[]) {
    solver();
}


Measured memory_bytes: 384