#include <bits/stdc++.h>
using namespace std;
void solution() {
  int n;
  vector<pair<long long, long long> > a, b, c, d;
  cin >> n;
  long long x, y, r = 0;
  for (int i = 0; i < int(n); i++) {
    cin >> x >> y;
    if (!x || !y) r++;
    if (x > 0)
      if (y > 0)
        a.push_back(make_pair(x, y));
      else
        d.push_back(make_pair(x, abs(y)));
    else if (y > 0)
      b.push_back(make_pair(abs(x), y));
    else
      c.push_back(make_pair(abs(x), abs(y)));
  }
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  sort(c.begin(), c.end());
  sort(d.begin(), d.end());
  cout << n * 6 - 2 * r << endl;
  for (int i = 0; i < int(d.size()); i++) {
    cout << "1 " << d[i].first << " R\n";
    if (d[i].second) cout << "1 " << d[i].second << " D\n";
    cout << 2 << endl;
    if (d[i].second) cout << "1 " << d[i].second << " U\n";
    cout << "1 " << d[i].first << " L\n";
    cout << 3 << endl;
  }
  for (int i = 0; i < int(a.size()); i++) {
    cout << "1 " << a[i].first << " R\n";
    cout << "1 " << a[i].second << " U\n";
    cout << 2 << endl;
    cout << "1 " << a[i].second << " D\n";
    cout << "1 " << a[i].first << " L\n";
    cout << 3 << endl;
  }
  for (int i = 0; i < int(c.size()); i++) {
    if (c[i].first) cout << "1 " << c[i].first << " L\n";
    if (c[i].second) cout << "1 " << c[i].second << " D\n";
    cout << 2 << endl;
    if (c[i].second) cout << "1 " << c[i].second << " U\n";
    if (c[i].first) cout << "1 " << c[i].first << " R\n";
    cout << 3 << endl;
  }
  for (int i = 0; i < int(b.size()); i++) {
    if (b[i].first) cout << "1 " << b[i].first << " L\n";
    cout << "1 " << b[i].second << " U\n";
    cout << 2 << endl;
    cout << "1 " << b[i].second << " D\n";
    if (b[i].first) cout << "1 " << b[i].first << " R\n";
    cout << 3 << endl;
  }
}
int main() {
  double beg = clock();
  ios::sync_with_stdio(false);
  solution();
  return 0;
}
