#include <bits/stdc++.h>
using namespace std;
int N, sum, ans;
class rec {
 public:
  int x, y;
} P[100010];
bool cmp(const rec &a, const rec &b) {
  if (abs(a.x) != abs(b.x)) return abs(a.x) < abs(b.x);
  return abs(a.y) < abs(b.y);
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%d%d", &P[i].x, &P[i].y);
  sort(P + 1, P + N + 1, cmp);
  for (int i = 1; i <= N; i++) {
    sum = 6;
    if (P[i].x == 0) sum -= 2;
    if (P[i].y == 0) sum -= 2;
    ans += sum;
  }
  printf("%d\n", ans);
  for (int i = 1; i <= N; i++) {
    if (P[i].x) {
      if (P[i].x > 0)
        printf("1 %d R\n", P[i].x);
      else
        printf("1 %d L\n", abs(P[i].x));
    }
    if (P[i].y) {
      if (P[i].y > 0)
        printf("1 %d U\n", P[i].y);
      else
        printf("1 %d D\n", abs(P[i].y));
    }
    printf("2\n");
    if (P[i].x) {
      if (P[i].x > 0)
        printf("1 %d L\n", P[i].x);
      else
        printf("1 %d R\n", abs(P[i].x));
    }
    if (P[i].y) {
      if (P[i].y > 0)
        printf("1 %d D\n", P[i].y);
      else
        printf("1 %d U\n", abs(P[i].y));
    }
    printf("3\n");
  }
}
