#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////
vll X(2001, 0);

void pl(ll i, ll j, ll k) {
	cout << "+" << " " << i << " " << j << " " << k << endl;

	X[k] = X[i] + X[j];

	//rep(i, 120)cout << X[i] << " ";
	//cout << endl;
}

void hi(ll i, ll j, ll k) {
	cout << "<" << " " << i << " " << j << " " << k << endl;

	if (X[i] < X[j]) { X[k] = 1; }
	else { X[k] = 0; }

	//rep(i, 120)cout << X[i] << " ";
	//cout << endl;
}

int main() {
	cout << 29974 << endl;
	ll A, B;
	//cin >> A >> B;
	//X[0] = A;
	//X[1] = B;

	ll T = 30;

	pl(0, 1, 2);
	hi(3, 2, 3);
	//X[i]=1<<(i-3);(3to2*T+2)
	repn(i, 2*T-1) {
		pl(2 + i, 2 + i, 3 + i);
	}

	rep(j, 2) {
		ll a = j;
		ll now = 2 * T + 2 + 1 + j * (T + 2);
		ll see = 2 * T + 2 + 2 + j * (T + 2);

		pl(a, 3, a);//aに1たす
		repn(i, T) {
			ll j= T + 3 - i;
			pl(now, j, see);

			hi(see, a, see + i);//i番目の桁決定
			hi(1000, see + i, 2);
			rep(j, T-i) { pl(2, 2, 2); }
			pl(2, now, now);
		}
	}

	hi(2, 1000, 2);

	rep(i, T)rep(j, T) {
		ll k = 3 * T + 4 - i;
		ll l = 4 * T + 6 - j;

		ll p = (i + j) + 3;
		pl(k, l, 0);
		hi(3, 0, 0);

		rep(j, p-3) { pl(0, 0, 0); }
		pl(2, 0, 2);
	}

	//cout << X[2] << endl;
}


Measured memory_bytes: 3592