Problem: 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

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.

Examples

Input

3
-1 0
0 3
2 -1


Output

2
1 2
RL
UU
DR


Input

5
0 0
1 0
2 0
3 0
4 0


Output

-1


Input

2
1 1
1 1


Output

2
1 1
RU
UR


Input

3
-7 -3
7 3
-3 -7


Output

5
3 1 4 1 5
LRDUL
RDULR
DULRD

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
#define fr(i,x,y) for(int i=x;i<=y;++i)
#define rf(i,x,y) for(int i=x;i>=y;--i)
#define LL long long
using namespace std;
const int N=1010;
struct data{
	LL x,y;
}a[N];
int dx[4]={1,0,-1,0};
int dy[4]={0,-1,0,1};
char ch[4]={'R','D','L','U'};
vector<LL>v;

int main(){
	int n;scanf("%d",&n);
	fr(i,1,n) scanf("%lld%lld",&a[i].x,&a[i].y);
	int flg=0;
	fr(i,1,n){
		if(i==1) flg=(a[i].x+a[i].y)&1;
		else if(flg!=((a[i].x+a[i].y)&1)) return printf("-1\n"),0;
	}
	rf(i,30,0) v.push_back(1LL<<i);
	if(!flg) v.push_back(1);
	int len=v.size();
	printf("%d\n",len);
	fr(i,0,len-1) printf("%lld ",v[i]);
	puts("");
	fr(i,1,n){
		LL xx=a[i].x,yy=a[i].y;
		fr(j,0,len-1){
			LL minn=1e18,res=-1;
			fr(o,0,3){
				LL nx=xx-v[j]*dx[o],ny=yy-v[j]*dy[o];
				if(minn>abs(nx)+abs(ny)) minn=abs(nx)+abs(ny),res=o;
			}
			xx-=v[j]*dx[res],yy-=v[j]*dy[res];
			printf("%c",ch[res]);
		}
		puts("");
	}
	return 0;
}