#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pli;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


string op[200];
int main() {
    cin >> n;
    vector<string> ans;
    for (int i = 1; i < n + 1; i++) cin >> op[i] >> w[i];
    bool f = 0;
    for (int i = 1; i < n + 1; i++) {
        if (op[i] == "+") {
            if (!f) ans.push_back("add a a A[" + to_string(i) + "]");
            else {
                ans.push_back("mul c b A[" + to_string(i) + "]");
                ans.push_back("add a a c");
            }
        } else if (op[i] == "*") {
            ans.push_back("mul a a A[" + to_string(i) + "]");
        } else {
            if (f) ans.push_back("mul b b A[" + to_string(i) + "]");
            else f = 1, ans.push_back("add b b A[" + to_string(i) + "]");
        }
    }
    if (f) ans.push_back("div a a b");
    printf("%d\n", ans.size());
    for (auto u : ans) puts(u.c_str());
    return 0;
}