#include<iostream>
const int N = 1005;
long long dp[N][N];
long long p[N];
int pos[N][N];
int posl[N];//记录左括号位置
int posr[N];//记录右括号位置
using namespace std;
void traceback(int i,int j) {
  if (i == j)
    return;
  traceback(i, pos[i][j]);
  traceback(pos[i][j] + 1, j);
  posl[i]++;
  posr[j]++;
  cout << "Multiply A" << i << "," << pos[i][j] << " and A" << pos[i][j] + 1 << "," << j<<endl;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i <= n; i++)
    cin >> p[i];
  for (int i = 1; i <= n; i++)
    dp[i][i] = 0;
  for (int len = 2; len <= n; len++) {
    for (int i = 1; i <= n - len + 1; i++) {
      int j = i + len - 1;
      dp[i][j] = dp[i + 1][j] + p[i - 1] * p[i] * p[j];
      pos[i][j] = i;
      for (int k = i + 1; k < j; k++) {
        int t = dp[i][k] + dp[k + 1][j] + p[i - 1] * p[k] * p[j];
        if (t < dp[i][j]) {
          dp[i][j] = t;
          pos[i][j] = k;
        }
      }
    }
  }
  cout << "计算次数" << dp[1][n] << endl;
  traceback(1, n);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < posl[i]; j++)
      cout << '(';
    cout << 'A' << i ;
    for (int j = 0; j < posr[i]; j++)
      cout << ')';
  }
}