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() {
  try {
    for (; ; ) {
      const N = readInt;
      auto C = new char[N];
      auto A = new int[N];
      foreach (i; 0 .. N) {
        C[i] = readToken[0];
        A[i] = readInt;
      }
      
      alias Op = Tuple!(string, "t", string, "x", string, "y", string, "z");
      Op[] ops;
      bool one = true;
      foreach (i; 0 .. N) {
        const a = format("A[%s]", i + 1);
        if (C[i] == '+') {
          if (one) {
            ops ~= Op("add", "p", "p", a);
          } else {
            ops ~= Op("mul", "t", "q", a);
            ops ~= Op("add", "p", "p", "t");
          }
        } else if (C[i] == '*') {
          ops ~= Op("mul", "p", "p", a);
        } else if (C[i] == '/') {
          if (one) {
            ops ~= Op("add", "q", "q", a);
            one = false;
          } else {
            ops ~= Op("mul", "q", "q", a);
          }
        } else {
          assert(false);
        }
      }
      if (one) {
//        ops ~= Op("add", "a", "a", "p");
        foreach (ref op; ops) {
          if (op.x == "p") op.x = "a";
          if (op.y == "p") op.y = "a";
          if (op.z == "p") op.z = "a";
        }
      } else {
        ops ~= Op("div", "a", "p", "q");
      }
      
      writeln(ops.length);
      foreach (op; ops) {
        writeln(op.t, " ", op.x, " ", op.y, " ", op.z);
      }
    }
  } catch (EOFException e) {
  }
}