#ifndef ONLINE_JUDGE #define _GLIBCXX_DEBUG #endif #include #include #include using namespace std; using namespace atcoder; using ll = long long; using mint = modint998244353; //using mint = modint1000000007; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++) #define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--) #define all(v) v.begin(), v.end() void _u() { cerr << endl; } template void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); } #define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); } template bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; } template bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; } template istream& operator>>(istream &in, vector &a) { for(T &x: a) in >> x; return in; } template ostream& operator<<(ostream &out, const vector &a) { for(const T &x: a) out << x << ' '; return out; } const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0}; const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0}; int main() { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector op(n); vector a(n); rep(i, n) cin >> op[i] >> a[i]; vector s; bool flag = false; rep(i, n) { if(op[i] == '+') { if(flag) { s.push_back("mul b A[" + to_string(i+1) + "] c"); s.push_back("add a a b"); } else { s.push_back("add a a A[" + to_string(i+1) + "]"); } } if(op[i] == '*') { s.push_back("mul a a A[" + to_string(i+1) + "]"); } if(op[i] == '/') { if(flag) { s.push_back("mul c A[" + to_string(i+1) + "] c"); } else { s.push_back("add c d A[" + to_string(i+1) + "]"); flag = true; } } } if(flag) { s.push_back("div a a c"); } cout << s.size() << '\n'; rep(i, s.size()) { cout << s[i] << '\n'; } return 0; }