#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h&& j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "Interpolation.h"
#include "IntMod.h"
#include "KDTree.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "List.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

const int MAX_N = 200000;
// + : t == 0
// < : t == 1
struct Query {
	int t, i, j, k;
};

const int bits = 31;
vector<Query> ans;
void out(ostream& ost) {
	ost << ans.size() << endl;
	for (auto&& p : ans) {
		if (p.t == 0) {
			ost << "+ " << p.i << ' ' << p.j << ' ' << p.k << endl;
		} else {
			ost << "< " << p.i << ' ' << p.j << ' ' << p.k << endl;
		}
	}
}

void pls(int i, int j, int k) {
	ans.push_back(Query{ 0, i, j, k });
}

void comp(int i, int j, int k) {
	ans.push_back(Query{ 1, i, j, k });
}

void pre() {
	pls(0, 1, MAX_N - 1);
}

void one(int pos) {
	comp(MAX_N - 2, MAX_N - 1, pos);
}

void zero(int pos) {
	comp(pos, pos, pos);
}

void pw(int tar, int k) {
	REP(z, 0, k) {
		pls(tar, tar, tar);
	}
}

void bin(int tar, int pos, int mem) {
	int copied = mem;
	int sum = mem + 1;
	int tmp = mem + 2;
	int res = mem + 3;
	one(copied);
	pls(copied, tar, copied);
	REM(k, 0, bits) {
		one(tmp);
		pw(tmp, k);
		pls(tmp, sum, tmp);
		comp(tmp, copied, res);
		comp(tmp, copied, pos + k);
		pw(res, k);
		pls(sum, res, sum);
		zero(tmp);
		zero(res);
	}
	zero(sum);
	zero(tmp);
	zero(res);
	zero(copied);
}

int main() {
	pre();
	int a = 3;
	int b = a + bits;
	int c = b + bits;
	int d = c + bits * bits;
	bin(0, a, 3 * bits);
	bin(1, b, 3 * bits);

	one(d);
	REP(i, 0, bits) {
		REP(j, 0, bits) {
			int pos = c + i * bits + j;
			pls(a + i, b + j, pos);
			comp(d, pos, pos);
			pw(pos, i + j);
			pls(2, pos, 2);
		}
	}

	out(cout);
	return 0;
}



Measured memory_bytes: 4104