#include <stdio.h>#include <iostream>#include <string.h>using namespace std;int ans[5];int visted[200];int selected[200];void DFS(int n, int index){ if (index == 3) { if (n * n * n == ans[0] * ans[0] * ans[0] + ans[1] * ans[1] * ans[1] + ans[2] * ans[2] * ans[2] && selected[ans[0]] * selected[ans[1]] * selected[ans[2]] == 0) { printf("Cube = %d, Triple = (%d,%d,%d)n", n, ans[0], ans[1], ans[2]); selected[ans[0]] = selected[ans[1]] = selected[ans[2]] = 1; } return; } for (int i = 2; i < n; i++) { if (!visted[i]) { visted[i] = 1; ans[index] = i; DFS(n, index + 1); visted[i] = 0; } }}int main(){ int n; scanf("%d", &n); for (int i = 6; i <= n; i++) { memset(visted, 0, sizeof(visted)); memset(selected, 0, sizeof(selected)); DFS(i, 0); } return 0;}