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

#define llong long long 
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define rand __rand
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());  // or mt19937_64
template<class T = int> T rand(T range = numeric_limits<T>::max()) { return (T)(rng() % range); }

#define CONCAT_(x, y) x##y/*{{{*/
#define CONCAT(x, y) CONCAT_(x, y)
#ifdef LOCAL_DEBUG   
int __db_level = 0;
bool __db_same_line = false;
#define clog cerr << string(!__db_same_line ? __db_level * 2 : 0, ' ')
struct debug_block {
    function<void()> fn;
    void print_name() { __db_same_line = true; fn(); clog << endl; __db_same_line = false;  }
    debug_block(function<void()> fn_): fn(fn_) { clog << "{ "; print_name(); ++__db_level; }
    ~debug_block() { --__db_level; clog << "} "; print_name(); }
};
#define DB(args...) debug_block CONCAT(dbbl, __LINE__)([=]{ clog << args; })
#define deb(...)  if (1) { (clog << "[" #__VA_ARGS__ "] = [" << __VA_ARGS__) << "]"; if (!__db_same_line) clog << endl; }
#else
#define clog if (0) cerr
#define DB(...)
#define deb(...)
#endif
template<class T>
ostream& operator,(ostream& out, const T& thing) { return out << ", " << thing; }
template<class U, class V>
ostream& operator<<(ostream& out, const pair<U, V>& p) { return (out << "(" << p.first, p.second) << ")"; }
template<class A, class B>
ostream& operator<<(ostream& out, const tuple<A, B>& t) { return (out << "(" << get<0>(t), get<1>(t)) << ")"; }
template<class A, class B, class C>
ostream& operator<<(ostream& out, const tuple<A, B, C>& t) { return (out << "(" << get<0>(t), get<1>(t), get<2>(t)) << ")"; }
template<class T> ostream& operator<<(ostream& out, const vector<T>& container) { 
    out << "{";
    if (len(container)) out << container[0];
    rep1(i, len(container) - 1) out, container[i];
    return out << "}";
}
template<class x> vector<typename x::value_type> $v(const x& a) { return vector<typename x::value_type>(a.begin(), a.end()); }
#define ptrtype(x) typename iterator_traits<x>::value_type
template<class u> vector<ptrtype(u)> $v(u a, u b) { return vector<ptrtype(u)>(a, b); }/*}}}*/
// ACTUAL SOLUTION BELOW ////////////////////////////////////////////////////////////

constexpr int nbit = 32;

enum cells_layout {
    a = 0,
    b,
    final_result, 
    sum,
    zero,
    one,
    temp1,
    temp2,
    temp3,
    bin_a_reg,
    bin_b_reg = bin_a_reg + nbit,
    temp_reg = bin_b_reg + nbit,
    cells_layout_size = temp_reg + nbit
};

struct op {
    char type;
    int res, x, y;
    op() {}
    op(char t, int r, int u, int v): type(t), res(r), x(u), y(v) {}
};

ostream& operator<<(ostream& out, const op& u) {
    return out << u.type << ' ' << u.x << ' ' << u.y << ' ' << u.res;
}

vector<op> ops;

void add(int result, int x, int y) {
    ops.emplace_back('+', result, x, y);
}

void cmp_less(int result, int x, int y) {
    ops.emplace_back('<', result, x, y);
}


void cmp_greater(int result, int x, int y) {
    cmp_less(result, y, x);
}

void bin_not(int cell) {
    cmp_less(cell, cell, one);
}

void bin_or(int result, int x, int y) {
    add(result, x, y);
    cmp_less(result, zero, result);
}

template<bool keep = true>
void bin_and(int result, int x, int y) {
    bin_not(x);
    bin_not(y);
    bin_or(result, x, y);
    bin_not(result);
    if (!keep) return ;
    bin_not(x);
    bin_not(y);
}

void cmp_eq(int result, int x, int y, int temp = temp1) {
    cmp_less(temp, x, y);
    cmp_less(result, y, x);
    bin_not(temp);
    bin_not(result);
    bin_and(result, result, temp);
}

void bin_xor(int result, int x, int y, int temp = temp1) {
    cmp_eq(result, x, y, temp);
    bin_not(result);
}

void cmp_less_eq(int result, int a, int b) {
    cmp_greater(result, a, b);
    bin_not(result);
}

void cmp_greater_eq(int result, int a, int b) {
    cmp_less(result, a, b);
    bin_not(result);
}

void set_one(int cell) {
    cmp_less(cell, a, sum);
}

void set_zero(int cell) {
    cmp_less(cell, sum, a);
}

void shl(int cell, int cnt = 1) {
    while (cnt--) add(cell, cell, cell);
}

void to_bin(int num, int res, int temp_region) {
    set_zero(temp2);
    
    for (int i = nbit; i--; ) {
        set_one(temp1);
        rep(f, nbit) {
            add(temp3, temp1, temp2);
            cmp_greater_eq(temp_region + f, num, temp3);
            shl(temp1);
        }
        
        set_zero(temp2);
        rep(f, nbit) {
            int nxt = f == (nbit - 1) ? zero : temp_region + f + 1;
            cmp_less(temp_region + f, nxt, temp_region + f);
            bin_or(res + f, res + f, temp_region + f);
            add(temp1, zero, res + f);
            shl(temp1, f);
            add(temp2, temp2, temp1);
        }
    }
}

void mul(int result, int reg1, int reg2) {
    set_zero(result);
    rep(i, nbit) rep(f, nbit) {
        bin_and(temp1, reg1 + i, reg2 + f);
        shl(temp1, i + f);
        add(result, result, temp1);
    }
}

int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    add(sum, a, b);
    set_one(one);
    set_zero(zero);
    
    to_bin(a, bin_a_reg, temp_reg);
    to_bin(b, bin_b_reg, temp_reg);  
    mul(final_result, bin_a_reg, bin_b_reg);  
    
    cout << len(ops) << '\n'; 
    for (auto& o: ops) cout << o << '\n';; 
    
    // vector<unsigned llong> arr(cells_layout_size); 
    // cin >> arr[0] >> arr[1]; 
    //  
    // for (auto& [t, r, x, y]:ops) { 
        // clog << t << ' ' << x << ' ' << y << ' ' << r << endl; 
        // if (t == '+') arr[r] = arr[x] + arr[y]; 
        // else arr[r] = arr[x] < arr[y]; 
    // } 
    
    // rep(i, nbit) { 
        // cout << arr[bin_a_reg + i] << '\n'; 
    // } 
    // cout << arr[2];  

    return 0;
}

// Remember:
// - Multitest? REFRESHING the data!!!
// - Constrains for each set of data may differs. Should NOT USE the same max constant (maxn)
//   for all of them.
// vim: foldmethod=marker



Measured memory_bytes: 5392