int p[1d6];
int s=Prime(11d6,p);
int u=1;
ll q[1d5]{-1};
rep(i,s-1){
	if(p[i]+2==p[i+1]){
		q[u++]=(ll)p[i]*p[i+1];
	}
}
int@t;
rep(t){
	ll@n;
	int i=bsearch_max[int,i,0,u](q[i]<=n);
	wt(q[i]);
}