#include <bits/stdc++.h>
using namespace std;
bool myComp(pair<long long, long long>& p1, pair<long long, long long>& p2) {
  return (p1.first * p1.first + p1.second * p1.second) <
         (p2.first * p2.first + p2.second * p2.second);
}
void Solve() {
  long long n, axis_pts = 0;
  cin >> n;
  pair<long long, long long> a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
    if (a[i].first == 0 || a[i].second == 0) axis_pts++;
  }
  sort(a, a + n, myComp);
  cout << 6 * n - 2 * axis_pts << endl;
  for (long long i = 0; i < n; i++) {
    long long x = a[i].first, y = a[i].second;
    if (x > 0) cout << "1 " + to_string(x) + " R\n";
    if (x < 0) cout << "1 " + to_string(-x) + " L\n";
    if (y > 0) cout << "1 " + to_string(y) + " U\n";
    if (y < 0) cout << "1 " + to_string(-y) + " D\n";
    cout << 2 << endl;
    if (y > 0) cout << "1 " + to_string(y) + " D\n";
    if (y < 0) cout << "1 " + to_string(-y) + " U\n";
    if (x > 0) cout << "1 " + to_string(x) + " L\n";
    if (x < 0) cout << "1 " + to_string(-x) + " R\n";
    cout << 3 << endl;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  Solve();
  return 0;
}
