//Arayi
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>

#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int> 
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2;
}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 1, -1, 0, 0, -1, -1, 1, 1, 0 };
int dy[] = { 0, 0, 1, -1, -1, 1, -1, 1, 0 };


const int N = 2e6 + 30;
const lli mod = 1e9 + 7;
const ld pi = acos(-1);
const int T = 238;
const ld e = 1e-13;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1) ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream& operator<<(ostream& c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
struct pt
{
    lli x, y;
    int ind;
    int bl;
    bool operator==(const pt& a)
    {
        return ind == a.ind;
    }
    bool operator<(const pt& b)
    {
        if (x == b.x) return y < b.y;
        return x < b.x;
    }
};


lli a[N];
int q;
void gum(int i, int j, int k)
{
    i--, j--, k--;
    q++;
    a[k] = a[i] + a[j];
    cout << "+ " << i << " " << j << " " << k << endl;
}
void pq(int i, int j, int k)
{
    i--, j--, k--;
    q++;
    a[k] = (a[i] < a[j]);
    cout << "< " << i << " " << j << " " << k << endl;
}
int n = 69420;

int main()
{
    fastio;
    cout << 5809 << endl;
    gum(1, 2, n - 1);
    pq(n, n - 1, n - 1);
    pq(n, n - 1, 5);
    for (int i = 6; i < 34; i++)
    {
        gum(i, i - 1, i);
        gum(i, i - 1, i);
        gum(i, n - 1, i);
    }
    for (int i = 33; i >= 4; i--)
    {
        gum(i, 34, i);
        pq(i, 1, 31 + i);
        for (int j = 30 + i; j >= 35; j--)
        {
            pq(n - 1, n, j);
            gum(j, j + 1, j);
            gum(j, j + 1, j);
        }
        gum(35, 34, 34);
    }
    pq(n - 1, n, 4);
    pq(n, n - 1, 5);
    for (int i = 6; i < 34; i++)
    {
        pq(n - 1, n, i);
        gum(i, i - 1, i);
        gum(i, i - 1, i);
        gum(i, n - 1, i);
    }
    for (int i = 33; i >= 4; i--)
    {
        gum(i, 1000, i);
        pq(i, 2, 997 + i);
        for (int j = 996 + i; j >= 1001; j--)
        {
            pq(n - 1, n, j);
            gum(j, j + 1, j);
            gum(j, j + 1, j);
        }
        gum(1001, 1000, 1000);
    }
    for (int i = 35; i <= 64; i++)
    {
        for (int j = 1001; j <= 1030; j++)
        {
            gum(i, j, 5000);
            pq(n - 1, 5000, 5000);
            gum(5000, i + j + 964, i + j + 964);
        }
    }
    for (int i = 2057; i >= 2000; i--)
    {
        gum(i, i + 1, i);
        gum(i, i + 1, i);
    }
    pq(n - 1, n, 3);
    gum(3, 2000, 3);
    return 0;
}

/*

  __
*(><)*
  \/ /
  ||/
--||
  ||
  /\
 /  \
/    \
*/

Measured memory_bytes: 3704