#include <bits/stdc++.h>
using namespace std;
int n, x[100007], y[100007], xx, yy, sum;
char c, c1, cc, cc1;
pair<pair<int, int>, pair<int, int> > p[100007];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x[i], &y[i]);
    p[i] = make_pair(make_pair(abs(x[i]), abs(y[i])),
                     make_pair(x[i] > 0, y[i] > 0));
    if (x[i] && y[i])
      sum += 4;
    else
      sum += 2;
  }
  sort(p, p + n);
  cout << sum + 2 * n << "\n";
  for (int i = 0; i < n; i++) {
    if (!p[i].second.first) {
      c = 'L';
      cc = 'R';
    } else {
      c = 'R';
      cc = 'L';
    }
    if (!p[i].second.second) {
      c1 = 'D';
      cc1 = 'U';
    } else {
      c1 = 'U';
      cc1 = 'D';
    }
    xx = p[i].first.first, yy = p[i].first.second;
    if (xx) printf("1 %d", xx);
    if (xx) printf(" %c \n", c);
    if (yy) printf("1 %d", yy);
    if (yy) printf(" %c \n", c1);
    printf("2\n");
    if (xx) printf("1 %d", xx, cc);
    if (xx) printf(" %c \n", cc);
    if (yy) printf("1 %d", yy, cc1);
    if (yy) printf(" %c \n", cc1);
    printf("3\n");
  }
  return 0;
}
