#include <bits/stdc++.h>
using namespace std;
struct point {
  int x, y;
} p[100005];
struct oper {
  int u, d, l, r;
} op[100005];
bool cmp(point a, point b) { return abs(a.x) + abs(a.y) < abs(b.x) + abs(b.y); }
int main() {
  int n, cnt = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d%d", &p[i].x, &p[i].y);
  sort(p, p + n, cmp);
  for (int i = 0; i < n; i++) {
    op[i].l = 1100000000, op[i].d = 1100000000, op[i].r = 1100000000,
    op[i].u = 1100000000;
    if (p[i].x > 0)
      op[i].r = p[i].x, cnt += 2;
    else if (p[i].x < 0)
      op[i].l = -p[i].x, cnt += 2;
    if (p[i].y > 0)
      op[i].u = p[i].y, cnt += 2;
    else if (p[i].y < 0)
      op[i].d = -p[i].y, cnt += 2;
    cnt += 2;
  }
  printf("%d\n", cnt);
  for (int i = 0; i < n; i++) {
    if (op[i].l != 1100000000) printf("1 %d L\n", op[i].l);
    if (op[i].r != 1100000000) printf("1 %d R\n", op[i].r);
    if (op[i].u != 1100000000) printf("1 %d U\n", op[i].u);
    if (op[i].d != 1100000000) printf("1 %d D\n", op[i].d);
    puts("2");
    if (op[i].l != 1100000000) printf("1 %d R\n", op[i].l);
    if (op[i].r != 1100000000) printf("1 %d L\n", op[i].r);
    if (op[i].u != 1100000000) printf("1 %d D\n", op[i].u);
    if (op[i].d != 1100000000) printf("1 %d U\n", op[i].d);
    puts("3");
  }
  return 0;
}
