#include <bits/stdc++.h>
using namespace std;
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  return abs(a.first) + abs(a.second) < abs(b.first) + abs(b.second);
}
long long op[1000006][4];
int main() {
  long long n;
  cin >> n;
  long long i, j;
  long long c = 0;
  pair<long long, long long> p[100005];
  for (i = 0; i < n; i++) {
    scanf("%lld%lld", &p[i].first, &p[i].second);
  }
  sort(p, p + n, comp);
  long long a, b;
  for (i = 0; i < n; i++) {
    a = p[i].first;
    b = p[i].second;
    j = 2;
    long long f1 = 0, f2 = 0;
    if (abs(0 - p[i].first) > 0) {
      op[c][0] = 1;
      op[c][1] = abs(0 - p[i].first);
      if (p[i].first < 0) {
        op[c][2] = 1;
      } else {
        op[c][2] = 2;
      }
      c++;
      f1 = 1;
    }
    if (abs(0 - p[i].second) > 0) {
      op[c][0] = 1;
      op[c][1] = abs(0 - p[i].second);
      if (p[i].second < 0) {
        op[c][2] = 3;
      } else {
        op[c][2] = 4;
      }
      c++;
      f2 = 1;
    }
    op[c][0] = 2;
    c++;
    if (f2) {
      op[c][0] = op[c - j][0];
      op[c][1] = op[c - j][1];
      if (op[c - j][2] == 1)
        op[c][2] = 2;
      else if (op[c - j][2] == 2)
        op[c][2] = 1;
      else if (op[c - j][2] == 3)
        op[c][2] = 4;
      else if (op[c - j][2] == 4)
        op[c][2] = 3;
      c++;
      j += 2;
    }
    if (f1) {
      op[c][0] = op[c - j][0];
      op[c][1] = op[c - j][1];
      if (op[c - j][2] == 1)
        op[c][2] = 2;
      else if (op[c - j][2] == 2)
        op[c][2] = 1;
      else if (op[c - j][2] == 3)
        op[c][2] = 4;
      else if (op[c - j][2] == 4)
        op[c][2] = 3;
      c++;
    }
    op[c][0] = 3;
    c++;
  }
  printf("%lld\n", c);
  for (i = 0; i < c; i++) {
    printf("%lld ", op[i][0]);
    if (op[i][0] == 1) {
      printf("%lld ", op[i][1]);
      if (op[i][2] == 1) {
        printf("L");
      } else if (op[i][2] == 2) {
        printf("R");
      } else if (op[i][2] == 3) {
        printf("D");
      } else if (op[i][2] == 4) {
        printf("U");
      }
    }
    printf("\n");
  }
  return 0;
}
