#include <iostream>
#include <fstream>
#include <list>

using namespace std;

int main(){
	ifstream in("podm.in");
	ofstream out("podm.out");

	int n;
	list<int> dimensions;
	
	int tmp;

	in >> n;
	for (int i = 0; i <= n; ++i){
		in >> tmp;
		dimensions.push_back(tmp);
	}

	long int op_count = 0;

	auto best = dimensions.begin();

	while (dimensions.size() >= 3){
		auto best = next(dimensions.begin());
		int max_dim = *best;
		cout << " -> ";
		for (auto it = best; next(it) != dimensions.end(); ++it){
			cout << *it << " ";
			if (*it > max_dim){
				max_dim = *it;
				best = it;
			} else if (*it == max_dim){
				int p1 = *prev(it) * (*it) * (*next(it));
				int p2 = *prev(best) * (*best) * (*next(best));
				if (p1 < p2){
					best = it;
				}
			}
		}
		cout << endl;

		op_count += *prev(best) * (*best) * (*next(best));

		dimensions.erase(best);

		for (auto it = dimensions.begin(); it != dimensions.end(); ++it){
			cout << *it << " ";
		}
		cout << endl;
	}

	out << op_count;

	return 0;
}