Problem:
Score : 600 points

Problem Statement

Snuke is introducing a robot arm with the following properties to his factory:

The robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.

For each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):

(x_0, y_0) = (0, 0).

If the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).

If the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).

If the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).

If the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).

Snuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.
Is this possible?
If so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).

Constraints

All values in input are integers.

1 \leq N \leq 1000

-10^9 \leq X_i \leq 10^9

-10^9 \leq Y_i \leq 10^9

Partial Score

In the test cases worth 300 points, -10 \leq X_i \leq 10 and -10 \leq Y_i \leq 10 hold.

Input

Input is given from Standard Input in the following format:

N
X_1 Y_1
X_2 Y_2
:
X_N Y_N

Output

If the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.

m
d_1 d_2 ... d_m
w_1
w_2
:
w_N

m and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.
Here, 1 \leq m \leq 40 and 1 \leq d_i \leq 10^{12} must hold. Also, m and d_i must all be integers.

w_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).
The i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.

Sample Input 1

3
-1 0
0 3
2 -1

Sample Output 1

2
1 2
RL
UU
DR

In the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:

To (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).

To (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).

To (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).

Sample Input 2

5
0 0
1 0
2 0
3 0
4 0

Sample Output 2

-1

Sample Input 3

2
1 1
1 1

Sample Output 3

2
1 1
RU
UR

There may be duplicated points among (X_j, Y_j).

Sample Input 4

3
-7 -3
7 3
-3 -7

Sample Output 4

5
3 1 4 1 5
LRDUL
RDULR
DULRD

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>

using namespace std;

int main(void){
  int n;
  cin >> n;
  vector<long long int> x(n);
  vector<long long int> y(n);

  vector<long long int> u(n);
  vector<long long int> v(n);

  unsigned int o_e;

  for(int i=0;i<n;i++){
    cin >> x[i];
    cin >> y[i];
    u[i] = x[i]+y[i];
    v[i] = x[i]-y[i];
    //cout << u[i] << " " << v[i] << endl;
    if(i==0){
      o_e = abs(u[i])%2;
      //cout << o_e << endl;
    }
    else{
      if(o_e != (u[i])%2){
        cout << -1 << endl;
        return 0;
      }
    }
  }
  //cout << o_e << endl;



  if(o_e == 0){
    cout << 32 << endl;
    cout << 1 << " ";
    for(int j=0;j<31;j++){
      cout << (1 << j) << " ";
    }
    cout << endl;
    for(int i=0;i<n;i++){

      long long int r_u = (u[i]-1+(long long int)((long long int)1<<31) - (long long int)1)/(long long int)2;
      long long int r_v = (v[i]-1+(long long int)((long long int)1<<31) - (long long int)1)/(long long int)2;
      //cout << r_u  << "," << r_v << endl;
      cout << 'R';
      for(int j=0;j<31;j++){
        //cout << ((r_u >> j) &1);
        unsigned int signal=((r_u >> j) &1) + 2*((r_v >> j) &1);
        switch(signal){
          case 0:
            cout << 'L';
            break;
          case 1:
            cout << 'U';
            break;
          case 2:
            cout << 'D';
            break;
          case 3:
            cout << 'R';
            break;
          default:
            break;
        }
      }
      cout << endl;
    }
  }
  else if(o_e == 1){
    cout << 31 << endl;
    for(int j=0;j<31;j++){
      cout << (1 << j) << " ";
    }
    cout << endl;

    for(int i=0;i<n;i++){
      long long int r_u = (u[i]+(long long int)((long long int)1<<31) - (long long int)1)/(long long int)2;
      long long int r_v = (v[i]+(long long int)((long long int)1<<31) - (long long int)1)/(long long int)2;
      for(int j=0;j<31;j++){
        //cout << ((r_u >> j) &1);
        unsigned int signal=((r_u >> j) &1) + 2*((r_v >> j) &1);
        switch(signal){
          case 0:
            cout << 'L';
            break;
          case 1:
            cout << 'U';
            break;
          case 2:
            cout << 'D';
            break;
          case 3:
            cout << 'R';
            break;
          default:
            abort();
            break;
        }
      }
      cout << endl;
      for(int j=0;j<32;j++){
        //cout << ((r_v >> j) &1);
      }
      //cout << endl;
    }
    //cout << endl;
  }
  else{
    return -1;
  }

  return 0;
}