#include <iostream>
#include <algorithm>
#include <cstdio>

void result(const int *b) {
	double result = (double)b[0] + (13.0 * (double)b[1] / (double)b[2]) + (double)b[3] + (12.0 * (double)b[4]) - (double)b[5] - 11.0 + ((double)b[6] * (double)b[7] / (double)b[8]) - 10.0;

	if (result == 66.0) {
		printf("%d + (13 * %d / %d) + %d + (12 * %d) - %d - 11 + (%d * %d / %d) - 10 = %d\n", b[0], b[1], b[2], b[3], b[4], b[5], b[6], b[7], b[8], (int)result);
	}
}

void calc() {
	int b[] = { 1, 2, 3, 4, 5, 6, 7 };

	std::sort(b, b + sizeof(b) / sizeof(int));

	do {
		result(b);
	} while (std::next_permutation(b, b + sizeof(b) / sizeof(int)));
}



int main(int argc, char* argv[])
{
	calc();
	return 0;
}