#include<iostream>

 #include<algorithm>

 #include<string>

 #include<cstring>

 #include<cmath>

 using namespace std;

 int n;

 int p[];

 int m[][], s[][];

 void dp()

 {

     for (int i = ; i <= n; i++)  m[i][i] = ;

     for (int r = ; r <= n;r++)

     for (int i = ; i <= n - r + ; i++)

     {

         int j = i + r - ;

         m[i][j] = m[i + ][j] + p[i - ] * p[i] * p[j];

         s[i][j] = i;

         for (int k = i + ; k < j; k++)

         {

             int t = m[i][k] + m[k + ][j] + p[i - ] * p[k] * p[j];

             if (t < m[i][j])

             {

                 m[i][j] = t;

                 s[i][j] = k;

             }

         }

     }

 }

 void print(int i,int j)

 {

     if (i == j)

         cout << "A" << i;

     else

     {

         cout << "(";

         print(i, s[i][j]);

         cout << " x ";

         print(s[i][j] + , j);

         cout << ")";

     }

 }

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     int kase = ;

     while (cin >> n&& n)

     {

         for (int i = ; i <= n; i++)

             cin >> p[i - ] >> p[i];

         dp();

         cout << "Case " << ++kase << ": ";

         print(,n);

         cout << endl;

     }

     return ;

 }