object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer

  import scala.collection.mutable
  import scala.util.Sorting
  import math.{abs, max, min}
  import mutable.{ArrayBuffer, ListBuffer}
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val N = ni()
    val X, Y = Array.ofDim[Int](N)
    rep(N) { i =>
      X(i) = ni()
      Y(i) = ni()
    }

    val Z = map(N)(i => abs(X(i)) + abs(Y(i)))
    val cntEven = Z count(_ % 2 == 0)
    val cntOdd = Z count(_ % 2 == 1)

    if (cntEven > 0 && cntOdd > 0) {
      out.println(-1)
      return
    }

    if (cntEven > 0) {
      rep(N) { i =>
        X(i) += 1
      }
    }

    val pow2 = Array.ofDim[Int](32)
    pow2(0) = 1
    rep(31)(i => pow2(i + 1) = pow2(i) * 2)

    val MAX = map(N)(i => abs(X(i)) + abs(Y(i))).max
    val M = log2(MAX) + 1
    val S = pow2(M) - 1

    /**
      * setのOnOffを元にxを表現するbitsetを返す
      */
    def bit(set: Long, x: Int): Long = {
      var a = x
      var res = 0L
      var i = 0
      while(a != 0) {
        val p = if ((set & 1 << i) > 0) pow2(i) else -pow2(i)
        if (a % (p * 2) != 0) {
          a -= p
          res |= 1 << i
        }
        i += 1
      }
      res
    }

    def mark(set: Long)(f: Int => Unit): Unit = {
      rep(M) { i =>
        if ((1 << i & set) > 0) f(i)
      }
    }

    if (cntEven > 0) {
      out.println(M + 1)
      out.println((1 +: map(M)(pow2)).mkString(" "))
    } else {
      out.println(M)
      out.println(map(M)(pow2).mkString(" "))
    }

    rep(N) { i =>
      val x = X(i)
      val y = Y(i)
      val z = abs(x) + abs(y)
      val set = ~bit(S, (S - z) / 2) & S
      val xSet = bit(set, abs(x))
      val ySet = bit(set, abs(y))
      val move = Array.ofDim[Char](M)
      mark(xSet) { i =>
        val on = (1 << i & set) > 0
        val neg = x < 0
        move(i) = if (on ^ neg) 'R' else 'L'
      }
      mark(ySet) { i =>
        val on = (1 << i & set) > 0
        val neg = y < 0
        move(i) = if (on ^ neg) 'U' else 'D'
      }
      if (cntEven > 0) {
        out.println(s"L${move.mkString}")
      } else {
        out.println(move.mkString)
      }
    }
  }

  def log2(x: Int): Int = {
    var a = Integer.highestOneBit(x)
    var i = 0
    while(a > 1) {
      i += 1
      a >>>= 1
    }
    i
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.next()
  def ns(n: Int): Array[Char] = ns().toCharArray
  def na(n: Int): Array[Int] = map(n)(_ => ni())
  def nal(n: Int): Array[Long] = map(n)(_ => nl())
  def nm(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  def rep(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def rep_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }

  def map[@specialized A: ClassTag](n: Int)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    rep(n)(i => res(i) = f(i))
    res
  }

  def sumL(as: Array[Int]): Long = {
    var s = 0L
    rep(as.length)(i => s += as(i))
    s
  }
}
