#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m=mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

struct ste {
	char c; int i, j, k;
};
void solve() {
	vector<ste> ans;
	ans.push_back({ '+',0,1,3 });
	ans.push_back({ '<',2,3,4 });
	//i+4,[4,34)
	rep1(i, 29) {
		ans.push_back({ '+',i + 3,i + 3,i + 4 });
	}
	//34-A+1
	ans.push_back({ '+',0,4,34 });
	//35-cur

	//[36,66) A&(1<<i)
	per(i, 30) {
		ans.push_back({ '+',35,4 + i,66 });
		ans.push_back({ '<',66,34,i + 36 });
		ans.push_back({ '+',2,i + 36,66 });
		rep(j, i) {
			ans.push_back({ '+',66,66,66 });
		}
		ans.push_back({ '+',35,66,35 });
	}
	//66-B+1
	ans.push_back({ '+',1,4,66 });
	//67-cur

	//[68,98)
	per(i, 30) {
		ans.push_back({ '+',67,4 + i,98 });
		ans.push_back({ '<',98,66,i+68 });
		ans.push_back({ '+',2,i + 68,98 });
		rep(j, i) {
			ans.push_back({ '+',98,98,98 });
		}
		ans.push_back({ '+',67,98,67 });
	}
	rep(i, 30)rep(j, 30) {
		ans.push_back({ '+',36 + i,68 + j,99 });
		ans.push_back({ '<',4,99,99 });
		rep(k, i + j) {
			ans.push_back({ '+',99,99,99 });
		}
		ans.push_back({ '+',2,99,2 });
	}
	vector<ll> val(100);
	val[0] = 500; val[1] = 600;
	rep(i, ans.size()) {
		if (ans[i].c == '<') {
			val[ans[i].k] = val[ans[i].i] < val[ans[i].j];
		}
		else {
			val[ans[i].k] = val[ans[i].i] + val[ans[i].j];
		}
	}
	//cout << val[2] << "\n";
	//rep(i, 30)if (val[i + 36] > 0)cout << "?A " << i << "\n";
	//rep(i, 30)if (val[i + 68] > 0)cout << "?B " << i << "\n";

	cout << ans.size() << "\n";
	rep(i, ans.size()) {
		cout << ans[i].c << " " << ans[i].i << " " << ans[i].j << " " << ans[i].k << "\n";
	}

}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}


Measured memory_bytes: 20160