#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) {
  return (a.first * (long long)a.first + a.second * (long long)a.second) <
         (b.first * (long long)b.first + b.second * (long long)b.second);
}
int main() {
  int n;
  cin >> n;
  vector<pair<int, int> > c(n);
  int k = 0;
  for (int i = 0; i < n; i++) {
    cin >> c[i].first >> c[i].second;
    if (c[i].first != 0) k += 2;
    if (c[i].second != 0) k += 2;
    k += 2;
  }
  cout << k << endl;
  sort(c.begin(), c.end(), cmp);
  for (int i = 0; i < n; i++) {
    if (c[i].first)
      printf("1 %d %c\n", abs(c[i].first), c[i].first > 0 ? 'R' : 'L');
    if (c[i].second)
      printf("1 %d %c\n", abs(c[i].second), c[i].second > 0 ? 'U' : 'D');
    printf("2\n");
    if (c[i].first)
      printf("1 %d %c\n", abs(c[i].first), c[i].first > 0 ? 'L' : 'R');
    if (c[i].second)
      printf("1 %d %c\n", abs(c[i].second), c[i].second > 0 ? 'D' : 'U');
    printf("3\n");
  }
}
