//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;



#include <unistd.h>

struct Scanner {
    int fd = -1;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += ::read(fd, line + ed, (1 << 15) - ed);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) {
            bool sep = false;
            for (size_t i = st; i < ed; i++) {
                if (isspace(line[i])) {
                    sep = true;
                    break;
                }
            }
            if (!sep) reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] & 0xf);
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    int read_unsafe() { return 0; }
    template <class H, class... T> int read_unsafe(H& h, T&... t) {
        bool f = read_single(h);
        if (!f) return 0;
        return 1 + read_unsafe(t...);
    }
    Scanner(FILE* fp) : fd(fileno(fp)) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(__int128 val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }

    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

struct Q {
    bool ty;
    int i, j, k;
};

const int N = 200000;
V<Q> solve(ull a, ull b) {
    V<Q> ques;
    V<ull> table(N);
    table[0] = a;
    table[1] = b;

    auto add = [&](int i, int j, int k) {
        ques.push_back({true, i, j, k});
        table[k] = table[i] + table[j];
    };

    auto cmp = [&](int i, int j, int k) {
        ques.push_back({false, i, j, k});
        table[k] = table[i] < table[j];
    };

    // table[i] <<= l
    auto mul2n = [&](int i, int l) {
        for (int ph = 0; ph < l; ph++) {
            add(i, i, i);
        }
    };

    int vc = 3;
    auto alc = [&]{ return vc++; };

    int A = 0, B = 1, Z = 2;
    int zero = alc();
    V<int> pw2(62, -1);
    {
        int buf0 = alc(), buf1 = alc(), buf2 = alc();
        cmp(A, B, buf0);
        cmp(B, A, buf1);
        add(buf0, buf1, buf2);
        mul2n(buf2, 40);

        cmp(A, buf2, buf0);
        cmp(buf2, A, buf1);
        add(buf0, buf1, buf2);

        assert(table[buf2] == 1);

        pw2[0] = buf2;
        for (int i = 1; i < 62; i++) {
            pw2[i] = alc();
            add(pw2[i - 1], pw2[i - 1], pw2[i]);
        }
        for (int i = 0; i < 62; i++) {
            assert(table[pw2[i]] == 1LL << i);
        }
    }
    int one = pw2[0];
    V<int> pw2n1(62, -1);
    {
        pw2n1[0] = zero;
        for (int i = 1; i < 62; i++) {
            pw2n1[i] = alc();
            add(pw2n1[i - 1], pw2[i - 1], pw2n1[i]);
        }
        for (int i = 0; i < 62; i++) {
            assert(table[pw2n1[i]] == (1LL << i) - 1);
        }
    }

    auto divide_bit = [&](int x) -> V<int> {
        V<int> v(31);
        int now = alc();
        for (int i = 30; i >= 0; i--) {
            v[i] = alc();
            int now2 = alc();
            add(now, pw2n1[i], now2);
            cmp(now2, x, v[i]);
            int now3 = alc();
            add(v[i], zero, now3);
            mul2n(now3, i);
            add(now, now3, now);
        }
        return v;
    };
    V<int> a_bit = divide_bit(A), b_bit = divide_bit(B);
    // dbg(a, b);
    // for (int i = 0; i < 31; i++) {
    //     dbg(table[a_bit[i]]);
    // }
    // for (int i = 0; i < 31; i++) {
    //     dbg(table[b_bit[i]]);
    // }
    {
        ll as = 0, bs = 0;
        for (int i = 0; i < 31; i++) {
            ll at = table[a_bit[i]];
            as += (at << i);
            if (at) {
                assert(a & (1 << i));
            }
            ll bt = table[b_bit[i]];
            bs += (bt << i);
            if (bt) {
                assert(b & (1 << i));
            }
        }
        assert((as == a) && (bs == b));
    }

    for (int i = 0; i < 31; i++) {
        for (int j = 0; j < 31; j++) {
            int buf = alc();
            add(a_bit[i], b_bit[j], buf);
            cmp(one, buf, buf);
            mul2n(buf, i + j);
            add(Z, buf, Z);
        }
    }

    assert(table[Z] == ll(a) * b);
                    ;
    return ques;
}


int main() {
/*    for (int a = 0; a < 10; a++) {
        for (int b = 0; b < 10; b++) {
            if (a == 0 && b == 0) continue;
            solve(a, b);
        }
    }*/
//    solve(1919810LL, 114514LL);


    auto ans = solve(0, 1);

    pr.writeln(ans.size());
    for (auto q : ans) {
        char c = (q.ty ? '+' : '<');
        pr.writeln(c, q.i, q.j, q.k);
    }
    return 0;
}


Measured memory_bytes: 5652