#include <bits/stdc++.h>
using namespace std;
struct myclass {
  bool operator()(const pair<long long, long long>& a,
                  const pair<long long, long long>& b) {
    if (abs(a.second) < abs(b.second))
      return true;
    else if (abs(a.second) == abs(b.second)) {
      if (abs(a.first) < abs(b.first))
        return true;
      else
        return false;
    } else
      return false;
  }
} mycomp;
int main() {
  long long n, count = 0, a, b;
  vector<pair<long long, long long> > v;
  scanf("%lld", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a);
    scanf("%lld", &b);
    v.push_back(pair<long long, long long>(a, b));
    if (!a || !b)
      count += 4;
    else
      count += 6;
  }
  sort(v.begin(), v.end(), mycomp);
  printf("%lld\n", count);
  for (int i = 0; i < n; i++) {
    if (v[i].second == 0) {
      if (v[i].first > 0)
        printf("1 %lld R\n2\n1 %lld L\n3\n", v[i].first, v[i].first);
      else
        printf("1 %lld L\n2\n1 %lld R\n3\n", -1 * v[i].first, -1 * v[i].first);
    } else if (v[i].first == 0) {
      if (v[i].second > 0)
        printf("1 %lld U\n2\n1 %lld D\n3\n", v[i].second, v[i].second);
      else
        printf("1 %lld D\n2\n1 %lld U\n3\n", -1 * v[i].second,
               -1 * v[i].second);
    } else {
      if (v[i].first > 0 && v[i].second > 0)
        printf("1 %lld U\n1 %lld R\n2\n1 %lld L\n1 %lld D\n3\n", v[i].second,
               v[i].first, v[i].first, v[i].second);
      else if (v[i].first > 0 && v[i].second < 0)
        printf("1 %lld D\n1 %lld R\n2\n1 %lld L\n1 %lld U\n3\n",
               -1 * v[i].second, v[i].first, v[i].first, -1 * v[i].second);
      else if (v[i].first < 0 && v[i].second < 0)
        printf("1 %lld D\n1 %lld L\n2\n1 %lld R\n1 %lld U\n3\n",
               -1 * v[i].second, -1 * v[i].first, -1 * v[i].first,
               -1 * v[i].second);
      else
        printf("1 %lld U\n1 %lld L\n2\n1 %lld R\n1 %lld D\n3\n", v[i].second,
               -1 * v[i].first, -1 * v[i].first, v[i].second);
    }
  }
  return 0;
}
