#include <bits/stdc++.h>
using namespace std;
const long long INF = 2e18;
const int inf = 2e9;
const long long mod = 1e8;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};
const int M = 40;
void add(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
const int N = 1e5 + 5;
pair<int, pair<int, int> > a[N];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].second.first >> a[i].second.second;
    a[i].first = abs(a[i].second.first) + abs(a[i].second.second);
  }
  sort(a + 1, a + n + 1);
  vector<pair<int, pair<int, char> > > v;
  for (int i = 1; i <= n; i++) {
    if (a[i].second.first != 0) {
      v.push_back(make_pair(1, make_pair(abs(a[i].second.first),
                                         (a[i].second.first < 0 ? 'L' : 'R'))));
    }
    if (a[i].second.second != 0) {
      v.push_back(
          make_pair(1, make_pair(abs(a[i].second.second),
                                 (a[i].second.second < 0 ? 'D' : 'U'))));
    }
    v.push_back(make_pair(2, make_pair(0, 0)));
    if (a[i].second.first != 0) {
      v.push_back(make_pair(1, make_pair(abs(a[i].second.first),
                                         (a[i].second.first < 0 ? 'R' : 'L'))));
    }
    if (a[i].second.second != 0) {
      v.push_back(
          make_pair(1, make_pair(abs(a[i].second.second),
                                 (a[i].second.second < 0 ? 'U' : 'D'))));
    }
    v.push_back(make_pair(3, make_pair(0, 0)));
  }
  printf("%d\n", (int)v.size());
  for (int i = 0; i < (int)v.size(); i++) {
    if (v[i].first == 1) {
      printf("%d %d %c\n", v[i].first, v[i].second.first, v[i].second.second);
    } else {
      printf("%d\n", v[i].first);
    }
  }
}
