#include <bits/stdc++.h>
using namespace std;
int main() {
  int x[100003], y[100003], n, step, id;
  pair<int, int> p[100003];
  cin >> n;
  step = 0;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
    if (x[i] != 0) step += 2;
    if (y[i] != 0) step += 2;
    step += 2;
    p[i].first = abs(x[i]) + abs(y[i]);
    p[i].second = i;
  }
  sort(p, p + n);
  cout << step << endl;
  for (int i = 0; i < n; i++) {
    id = p[i].second;
    if (x[id] > 0)
      cout << "1 " << x[id] << " R\n";
    else if (x[id] < 0)
      cout << "1 " << -1 * x[id] << " L\n";
    if (y[id] > 0)
      cout << "1 " << y[id] << " U\n";
    else if (y[id] < 0)
      cout << "1 " << -1 * y[id] << " D\n";
    cout << "2\n";
    if (x[id] > 0)
      cout << "1 " << x[id] << " L\n";
    else if (x[id] < 0)
      cout << "1 " << -1 * x[id] << " R\n";
    if (y[id] > 0)
      cout << "1 " << y[id] << " D\n";
    else if (y[id] < 0)
      cout << "1 " << -1 * y[id] << " U\n";
    cout << "3\n";
  }
  return 0;
}
