#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } 
} init_io; 
}
#define CPP17


int main() {
    using op_type = std::tuple<char, ll, ll, ll>;
    vec<op_type> ov;

    // a = A, B, 0, 0, 1, 2, 4, ..., 2^32
    ll offset1 = 4;
    ll idx0 = 3, idx1 = 4;
    ov.emplace_back('+', 0, 1, 2);
    ov.emplace_back('<', 3, 2, offset1);
    for (ll i = 1; i <= 32; i++) {
        ov.emplace_back('+', i - 1 + offset1, i - 1 + offset1, i + offset1);
    }

    auto get_pow2 = [&](ll i) {
        return offset1 + i;
    };

    auto clear = [&](ll i) {
        ov.emplace_back('<', i, i, i);
    };

    clear(2);

    // if a[i], a[j+p] = 2^p, else a[j+p] = 0
    auto gen_pow2 = [&](ll i, ll j, ll p) {
        ov.emplace_back('<', idx0, i, j);
        for (ll d = 1; d <= p; d++) {
            ov.emplace_back('+', j + d - 1, j + d - 1, j + d);
        }
    };

    ll buf = 1000;
    ll buf2 = 1500;
    ll buf3 = 2000;

    // a[i:i+33] = rev of bits of a[idx] (e.g. if a[idx] == 3, a[i:i+33] = 110...0)
    auto gen_bits = [&](ll i, ll idx) {
        ll cur_sum = buf;
        clear(cur_sum);
        for (ll d = 32; 0 <= d; d--) {
            ov.emplace_back('+', cur_sum, get_pow2(d), cur_sum + 1);
            ov.emplace_back('<', cur_sum + 1, idx, buf2);
            gen_pow2(buf2, buf3, d);
            ov.emplace_back('<', idx0, buf3 + d, i + d);
            ov.emplace_back('+', cur_sum, buf3 + d, cur_sum);
        }
    };

    // a[k] = a[i] && a[j];
    auto get_and = [&](ll i, ll j, ll k, ll buf) {
        clear(k);
        ov.emplace_back('<', idx0, i, buf);
        ov.emplace_back('+', buf, k, k);
        ov.emplace_back('<', idx0, j, buf);
        ov.emplace_back('+', buf, k, k);
        ov.emplace_back('<', idx1, k, k);
    };

    ll offset2 = offset1 + 50;
    ll offset3 = offset2 + 50;

    ov.emplace_back('+', 0, idx1, 0);
    ov.emplace_back('+', 1, idx1, 1);

    gen_bits(offset2, 0);
    gen_bits(offset3, 1);

    for (ll i = 0; i <= 32; i++) for (ll j = 0; j <= 32; j++) {
        get_and(offset2 + i, offset3 + j, buf, buf + 1);
        gen_pow2(buf, buf + 1, i + j);
        ov.emplace_back('+', 2, buf + 1 + i + j, 2);
    }

    std::cout << ov.size() << "\n";
    for (auto [ a, b, c, d ] : ov) {
        std::cout << a << ' ' << b << ' ' << c << ' ' << d << "\n";
    }
    return 0;
}


Measured memory_bytes: 5184