#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x)
#endif

vector<string> ret;
void add(int i, int j, int k)
{
    string s = "+ " + to_string(i) + " " + to_string(j) + " " + to_string(k);
    ret.emplace_back(s);
}

void compare(int i, int j, int k)
{
    // A[k] <- A[i] < A[j]
    string s = "< " + to_string(i) + " " + to_string(j) + " " + to_string(k);
    ret.emplace_back(s);
}

void reset(int i)
{
    // A[i] <- 0
    compare(i, i, i);
}

void copy(int i, int j)
{
    if (i == j) return;
    reset(j);
    add(i, j, j);
}

// 300番台使用
void multiply(int i, int j, lint X)
{
    // A[j] = A[i] * X
    copy(i, 300);
    REP(d, 60)
    {
        add(300 + d, 300 + d, 300 + d + 1);
        if (1LL << d >= X) break;
    }

    reset(j);
    REP(d, 60) if ((X >> d) & 1) add(300 + d, j, j);
}


// 100番台使用
void subtract(int i, int j, int ret)
{
    // A[k] <- A[i] - A[j]
    int tmp = 90, cum = 91;
    reset(cum);
    IREP(d, 32)
    {
        add(cum, j, tmp);
        add(tmp, 100 + d, tmp);
        compare(tmp, i, 92);
        multiply(92, 92, 1LL << d);
        add(92, cum, cum);
    }
    copy(cum, ret);
}

// 200番台使用
void bit_get(int i, int head)
{
    copy(i, 200);
    IREP(d, 30)
    {
        compare(100 + d, 200, head + d);
        multiply(head + d, 201, 1LL << d);
        subtract(200, 201, 200);
    }
}


int main()
{
    add(0, 1, 3);
    compare(2, 3, 10); // [A, B, 0, +, 0, 1]

    FOR(i, 10, 70) add(i, i, i + 1);
    REP(d, 60) add(100 + d, 100 + d, 100 + d + 1), add(10, 100 + d + 1, 100 + d + 1);

    // multiply(0, 400, 100);
    // subtract(0, 1, 2);

    bit_get(0, 500);
    bit_get(1, 600);
    REP(d, 30) REP(e, 30)
    {
        add(500 + d, 600 + e, 4);
        compare(10, 4, 4);
        multiply(4, 5, 1LL << (d + e));
        add(5, 2, 2);
    }
    cout << ret.size() << '\n';
    for (auto s : ret) cout << s << '\n';
}


Measured memory_bytes: 7448