#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <atcoder/modint>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
using Modint = atcoder::static_modint<998244353>;

bool verify(u64 x){
    vector<u64> A(4);
    A[2] = 1;
    A[1] = x;
    u64 mult = 0x2000000001 / 3;
    vector<string> Q;
    rep(d,37){
        if((mult >> d) & 1) A[3] = A[3] + A[1];
        A[1] = A[1] + A[1];
        A[3] /= 2;
        A[1] /= 2;
    }
    return A[3] == x / 3;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    u64 mult = 0x2000000001 / 3;
    vector<string> Q;
    rep(d,37){
        if((mult >> d) & 1) Q.push_back("plus 3 3 1");
        Q.push_back("plus 1 1 1");
        Q.push_back("div 3 3");
        Q.push_back("div 1 1");
    }
    cout << Q.size() << '\n';
    for(auto& q : Q) cout << q << '\n';
    return 0;
}