#include <bits/stdc++.h>
using namespace std;
inline void go(long long x, long long y) {
  if (x > 0)
    cout << "1 " << x << " R\n";
  else if (x < 0)
    cout << "1 " << -x << " L\n";
  if (y > 0)
    cout << "1 " << y << " U\n";
  else if (y < 0)
    cout << "1 " << -y << " D\n";
}
inline void come(long long x, long long y) {
  if (y > 0)
    cout << "1 " << y << " D\n";
  else if (y < 0)
    cout << "1 " << -y << " U\n";
  if (x > 0)
    cout << "1 " << x << " L\n";
  else if (x < 0)
    cout << "1 " << -x << " R\n";
}
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, cnt = 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) cnt++;
  }
  sort(a, a + n, myComp);
  cout << 6 * n - 2 * cnt << endl;
  for (long long i = 0; i < n; i++) {
    go(a[i].first, a[i].second);
    cout << 2 << endl;
    come(a[i].first, a[i].second);
    cout << 3 << endl;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  Solve();
  return 0;
}
