#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
using namespace std;
bool cmp(pair<int, int>& a, pair<int, int>& b) {
  return abs(a.first) + abs(a.second) < abs(b.second) + abs(b.first);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<pair<int, int> > v;
  for (int i = 1; i <= n; i++) {
    int a, b;
    cin >> a >> b;
    v.push_back({a, b});
  }
  sort(v.begin(), v.end(), cmp);
  vector<pair<int, pair<int, int> > > ans;
  for (int i = 0; i < n; i++) {
    int x = v[i].first, y = v[i].second;
    if (x < 0) {
      ans.push_back({1, {abs(x), 'L'}});
    } else if (x > 0) {
      ans.push_back({1, {abs(x), 'R'}});
    }
    if (y > 0) {
      ans.push_back({1, {abs(y), 'U'}});
    } else if (y < 0) {
      ans.push_back({1, {abs(y), 'D'}});
    }
    ans.push_back({2, {-1, -1}});
    if (x < 0) {
      ans.push_back({1, {abs(x), 'R'}});
    } else if (x > 0) {
      ans.push_back({1, {abs(x), 'L'}});
    }
    if (y > 0) {
      ans.push_back({1, {abs(y), 'D'}});
    } else if (y < 0) {
      ans.push_back({1, {abs(y), 'U'}});
    }
    ans.push_back({3, {-1, -1}});
  }
  cout << ans.size() << '\n';
  for (int i = 0; i < ans.size(); i++) {
    if (ans[i].first == 1) {
      cout << 1 << ' ' << ans[i].second.first << ' '
           << (char)ans[i].second.second << '\n';
    } else {
      cout << ans[i].first << '\n';
    }
  }
  return 0;
}
