#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<tuple<string,string,string,string>> ans;
    bool flag = false;
    rep(i,n){
        char op;
        int a;
        cin >> op >> a;
        if(op=='+'){
            if(flag){
                ans.emplace_back("mul", "b", "d", "A[" + to_string(i+1) +"]");
                ans.emplace_back("add", "a", "a", "b");
            }else{
                ans.emplace_back("add", "a", "a", "A[" + to_string(i+1) +"]");
            }
        }else if(op=='*'){
            ans.emplace_back("mul", "a", "a", "A[" + to_string(i+1) +"]");
        }else if(op=='/'){
            if(flag){
                ans.emplace_back("mul", "d", "d", "A[" + to_string(i+1) +"]");
            }else{
                ans.emplace_back("add", "d", "d", "A[" + to_string(i+1) +"]");
                flag = true;
            }
        }
    }
    if(flag){
        ans.emplace_back("div", "a", "a", "d");
    }
    cout << ans.size() << '\n';
    for(auto [p,q,r,s]:ans) cout << p << " " << q << " " << r << " " << s << '\n';
    return 0;
}