#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sign(int x) { return (x > 0) - (x < 0); }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

vector<string> ans;
void pl(int i, int j, int k) { ans.push_back("+ " + to_string(i) + " " + to_string(j) + " " + to_string(k)); }
void gr(int i, int j, int k) { ans.push_back("< " + to_string(i) + " " + to_string(j) + " " + to_string(k)); }
void zr(int i) { ans.push_back("< 0 0 " + to_string(i)); }
void inv(int i) { pl(i, i, 100), pl(i, 200, i), gr(100, i, i), zr(100); }
void pow(int i, int j, int n) {
    pl(100, i, 100);
    while (n--) { pl(100, 100, 100); }
    pl(j, 100, j), zr(100);
}
signed main() {
    // 100 常に0
    // 200+i 常に2^i
    gr(100, 0, 200);
    gr(100, 1, 201);
    pl(200, 201, 200);
    gr(100, 200, 200);
    rep(i, 63) { pl(200 + i, 200 + i, 200 + i + 1); }
    for (int i = 32; i >= 0; i--) {
        // 300+i Aの2^i成分
        // 350 Aの作業域
        zr(351);
        pl(350, 200 + i, 351);
        gr(0, 351, 300 + i);
        inv(300 + i);
        pow(300 + i, 350, i);
    }
    for (int i = 32; i >= 0; i--) {
        // 400+i Bの2^i成分
        // 450 Bの作業域
        zr(451);
        pl(450, 200 + i, 451);
        gr(1, 451, 400 + i);
        inv(400 + i);
        pow(400 + i, 450, i);
    }
    rep(i, 33) {
        rep(j, 33) {
            pl(300 + i, 400 + j, 500);
            gr(200, 500, 500);
            pow(500, 2, i + j);
        }
    }
    cout << ans.size() << endl;
    rep(i, ans.size()) { cout << ans[i] << endl; }
}


Measured memory_bytes: 5296