import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  debug {
    foreach (x; 0 .. 10^^5 + 1) {
      auto as = [x, 0, 0];
      foreach (iter; 0 .. 10) {
        foreach (i; 0 .. 3) {
          const j = (i + 1) % 3;
          const sum = as[i] + as[j];
          as[i] = (sum + 1) / 2;
          as[j] = sum / 2;
        }
      }
      // writeln(x, " ", x/3, ": ", as);
      assert(as[0] == x/3);
    }
  }
  
  void plus(int a, int b, int c) {
    writefln("plus %s %s %s", a, b, c);
  }
  void div(int a, int b) {
    writefln("div %s %s", a, b);
  }
  void oper(int a, int b) {
    plus(6, a, b);
    div(b, 6);
    plus(6, 6, 2);
    div(a, 6);
  }
  
  const m = (1000 - 1) / 12;
  writeln(1 + m * 12);
  plus(3, 3, 1);
  foreach (iter; 0 .. m) {
    oper(3, 4);
    oper(4, 5);
    oper(5, 3);
  }
}