/*
    author:  Maksim1744
    created: 09.08.2020 16:23:19
*/

#include <bits/stdc++.h>

using namespace std;

#define ll   long long
#define ld   long double

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T>& v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T>& v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T>& v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>& v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>& p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define TAG_LENGTH       25
#define LR_LEFT          left
#define LR_RIGHT         right
#define LR_VALUE         value
#define LR_SECOND_VALUE  mn
#include "C:/C++ libs/print.cpp"
#else
#define showl            42;
#define shows            42;
#define show(...)        42;
#define showm(...)       42;
#define showt(...)       42;
#define printTree(...)   42;
#define printGraph(...)  42;
#define printLRTree(...) 42;
#define printMatrix(...) 42;
#define printWGraph(...) 42;
#define debug     if (false)
#endif

stringstream ss;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    ss << "< 2 0 51\n";
    ss << "< 2 1 52\n";
    ss << "+ 51 52 53\n";
    ss << "< 2 53 3\n";
    auto zero = [&](int i) {
        ss << "< 3 2 " << i << '\n';
    };
    auto one = [&](int i) {
        ss << "< 2 3 " << i << '\n';
    };
    zero(51);
    zero(52);
    zero(53);
    // a from 100
    // b from 200
    for (int i = 30; i >= 0; --i) {
        // has in 10
        // p2 in 11
        // temp line from 50

        zero(10);
        for (int k = 0; k < 31; ++k) {
            ss << "< 2 " << 100 + k << ' ' << 7 << '\n';
            for (int j = 0; j < k; ++j) {
                ss << "+ 7 7 7\n";
            }
            ss << "+ 10 7 10\n";
        }

        one(11);
        for (int j = 0; j < i; ++j) {
            zero(50 + j);
        }
        for (int j = 0; j < i; ++j) {
            // 1 to 50+j if has+p2 <= a
            ss << "+ 10 11 12\n";
            ss << "+ 0 3 13\n";
            ss << "< 12 13 " << 50 + j << '\n';
            ss << "+ 11 11 11\n";
        }

        ss << "+ " << 50 + i - 1 << ' ' << 100 + i - 1 << ' ' << 100 + i - 1 << '\n';
    }


    for (int i = 30; i >= 0; --i) {
        // has in 10
        // p2 in 11
        // temp line from 50

        zero(10);
        for (int k = 0; k < 31; ++k) {
            ss << "< 2 " << 200 + k << ' ' << 7 << '\n';
            for (int j = 0; j < k; ++j) {
                ss << "+ 7 7 7\n";
            }
            ss << "+ 10 7 10\n";
        }

        one(11);
        for (int j = 0; j < i; ++j) {
            zero(50 + j);
        }
        for (int j = 0; j < i; ++j) {
            // 1 to 50+j if has+p2 <= a
            ss << "+ 10 11 12\n";
            ss << "+ 1 3 13\n";
            ss << "< 12 13 " << 50 + j << '\n';
            ss << "+ 11 11 11\n";
        }

        ss << "+ " << 50 + i - 1 << ' ' << 200 + i - 1 << ' ' << 200 + i - 1 << '\n';
    }

    zero(8);

    for (int i = 0; i < 31; ++i) {
        for (int j = 0; j < 31; ++j) {
            ss << "+ " << 100 + i << ' ' << 200 + j << ' ' << 20 << '\n';
            ss << "< 3 20 20\n";
            for (int k = 0; k < i + j; ++k) {
                ss << "+ 20 20 20\n";
            }
            ss << "+ 2 20 2\n";
        }
    }




    string s = ss.str();
    cout << count(s.begin(), s.end(), '\n') << '\n';
    cout << s;

    return 0;
}


Measured memory_bytes: 4504