#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = false;
}  // namespace mydef
using namespace mydef;
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans

vector<string> ans;

void f(int a, int i, int j, int k) {
    if (a == 0)
        ans.push_back("+ " + to_string(i) + " " + to_string(j) + " " + to_string(k));
    //cout << "+ " << i << " " << j << " " << k << endl;
    else
        ans.push_back("< " + to_string(i) + " " + to_string(j) + " " + to_string(k));
    //cout << "< " << i << " " << j << " " << k << endl;
}

void g(int n, int i) {
    while (n--) {
        f(0, i, i, i);
    }
}

void solve() {
    f(0, 0, 1, 100);
    f(0, 100, 1, 100);
    f(0, 100, 0, 100);
    f(1, 0, 100, 101);  //a[101]=1
    f(0, 101, 5, 100);  //a[100]=1
    for (int i = 101; i <= 163; i++) {
        f(0, i - 1, i - 1, i);  //a[100 + i] = 2^i
    }

    f(0, 0, 5, 10);
    f(0, 1, 5, 20);

    f(0, 10, 100, 10);
    f(0, 20, 100, 20);

    for (int i = 30; i >= 0; i--) {
        f(0, 11, 100 + i, 12);
        f(1, 12, 10, 15);
        f(0, 15, 5, 200 + i);
        g(i, 15);
        f(0, 15, 11, 11);

        f(0, 21, 100 + i, 22);
        f(1, 22, 20, 25);
        f(0, 25, 5, 300 + i);
        g(i, 25);
        f(0, 25, 21, 21);
    }


    for (int i = 0; i <= 30; i++) {
        for (int j = 0; j <= 30; j++) {
            int n = 1000;
            f(0, 200 + i, 300 + j, n);
            f(1, 100, n, n);
            g(i + j, n);
            f(0, 2, n, 2);
        }
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);


    solve();

    cout << ans.size() << endl;
    for (auto& s : ans)
        cout << s << endl;
    return 0;
}


Measured memory_bytes: 6600