#include <bits/stdc++.h>
using namespace std;
const int INF = ((long long)1E9 + 7);
template <class C>
void mini(C& aaaa, C bbbb) {
  aaaa = min(aaaa, bbbb);
}
template <class C>
void maxi(C& aaaa, C bbbb) {
  aaaa = max(aaaa, bbbb);
}
const int MX = 100100;
complex<int> p[MX];
bool comp(complex<int> a, complex<int> b) {
  return abs(a.real()) + abs(a.imag()) < abs(b.real()) + abs(b.imag());
}
void go(complex<int> a) {
  if (a.real() > 0) cout << 1 << " " << a.real() << " R" << endl;
  if (a.real() < 0) cout << 1 << " " << -a.real() << " L" << endl;
  if (a.imag() > 0) cout << 1 << " " << a.imag() << " U" << endl;
  if (a.imag() < 0) cout << 1 << " " << -a.imag() << " D" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 0; i < (n); ++i) {
    int x, y;
    cin >> x >> y;
    p[i] = complex<int>(x, y);
  }
  sort(p, p + n, comp);
  int res = 0;
  for (int i = 0; i < (n); ++i) {
    res += 6;
    if (p[i].real() == 0) res -= 2;
    if (p[i].imag() == 0) res -= 2;
  }
  cout << res << endl;
  for (int i = 0; i < (n); ++i) {
    go(p[i]);
    cout << 2 << endl;
    go(complex<int>(0, 0) - p[i]);
    cout << 3 << endl;
  }
  return 0;
}
