#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = decltype(std::rbegin(std::declval<T>()));

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 17 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

struct query {
  const char type;
  const size_t i, j, k;
  query(const char type, const size_t i, const size_t j, const size_t k):
    type(type), i(i), j(j), k(k)
  { }
};

size_t add_index() {
  static size_t size = 0;
  return size++;
}

std::vector<size_t> add_indices(const size_t size) {
  std::vector<size_t> res(size);
  for (auto i: range(0, size)) {
    res[i] = add_index();
  }
  return res;
}

void output(const std::vector<query> &calculator) {
  std::cout << calculator.size() << '\n';
  for (auto [c, i, j, k]: calculator) {
    std::cout << c << ' ' << i << ' ' << j << ' ' << k << '\n';
  }
}

#ifdef LOCAL
std::array<i64, 200000> array;
#endif

int main() {
  std::vector<query> calculator;
  auto add = [&](const size_t i, const size_t j, const size_t k) {
    calculator.push_back(query('+', i, j, k));
#ifdef LOCAL
    array[k] = array[i] + array[j];
#endif
  };
  auto comp = [&](const size_t i, const size_t j, const size_t k) {
    calculator.push_back(query('<', i, j, k));
#ifdef LOCAL
    array[k] = array[i] < array[j];
#endif
  };
  const auto A = add_index();
  const auto B = add_index();
#ifdef LOCAL
  array[A] = 29;
  array[B] = 32;
#endif
  const auto ans = add_index();
  const auto zero = add_index();
  const auto pow2 = add_indices(60);
  add(A, B, pow2[0]);
  comp(zero, pow2[0], pow2[0]);
  for (auto i: range(1, pow2.size())) {
    add(pow2[i - 1], pow2[i - 1], pow2[i]);
  }
  const auto flag = add_index();
  const auto compare = add_index();
  const auto current = add_index();
  const auto binaryA = add_indices(30);
  add(A, pow2[0], A);
  for (auto i: rev(range(0, binaryA.size()))) {
    add(current, pow2[i], compare);
    comp(compare, A, flag);
    add(zero, flag, binaryA[i]);
    for (auto j: range(0, i)) {
      add(flag, flag, flag);
    }
    add(flag, current, current);
  }
  add(zero, zero, flag);
  add(zero, zero, compare);
  add(zero, zero, current);
  const auto binaryB = add_indices(30);
  add(B, pow2[0], B);
  for (auto i: rev(range(0, binaryB.size()))) {
    add(current, pow2[i], compare);
    comp(compare, B, flag);
    add(zero, flag, binaryB[i]);
    for (auto j: range(0, i)) {
      add(flag, flag, flag);
    }
    add(flag, current, current);
  }
  for (auto i: range(0, binaryA.size())) {
    for (auto j: range(0, binaryB.size())) {
      add(binaryA[i], binaryB[j], flag);
      comp(pow2[0], flag, flag);
      for (auto k: range(0, i + j)) {
        add(flag, flag, flag);
      }
      add(ans, flag, ans);
    }
  }
#ifdef LOCAL
  std::cout << "answer: " << array[ans] << '\n';
#else
  output(calculator);
#endif
  return 0;
}


Measured memory_bytes: 4036