#include <queue>#include <stack>#include <math.h>#include <stdio.h>#include <stdlib.h>#include <iostream>#include <limits.h>#include <string.h>#include <algorithm>using namespace std;int a[1010];void init(){int i,k,j;for(i=1; i<=1000; i++)a[i] = INT_MAX;for(i=1; i<=1000; i++)for(j=i; j<=1000; j++){if( i*j > 1000 )break;for(k=j; k<=1000; k++){if( i*j*k > 1000 )break;a[i*j*k] = min(a[i*j*k],2*(k*i + k*j + i*j));}}}int main(){int ncases,n;init();scanf("%d",&ncases);while( ncases-- ){scanf("%d",&n);printf("%dn",a[n]);}return 0;}
