#include <bits/stdc++.h>
using namespace std;
int x[100010], y[100010], a[100010];
void o1(int x, int y) {
  if (x) printf("1 %d %c\n", abs(x), x < 0 ? 'L' : 'R');
  if (y) printf("1 %d %c\n", abs(y), y < 0 ? 'D' : 'U');
}
void o(int x, int y) {
  o1(x, y);
  printf("2\n");
  o1(-x, -y);
  printf("3\n");
}
int main() {
  int n, single = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", x + i, y + i);
    if (!x[i] || !y[i]) single++;
    a[i] = i;
  }
  sort(a, a + n, [](int i, int j) {
    return abs(x[i]) + abs(y[i]) < abs(x[j]) + abs(y[j]);
  });
  printf("%d\n", 4 * single + (n - single) * 6);
  for (int i = 0; i < n; i++) o(x[a[i]], y[a[i]]);
  return 0;
}
