RT 救救蒟蒻

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MX=10000010;
int T;
int ex[MX];
bool div(int x){
	while(x){
		if(x%10==7) return false;
		x/=10;
	}
	return true;
}
void memsett(){
	for(int i=1;i<=MX;i++){
		if(ex[i]==1) continue;
		if(i%7==0){ex[i]=1; continue;}
		if(!div(i)){
			ex[i]=1;
			for(int j=1;j*i<=MX;j++) ex[i*j]=1;
		}
	}
}
int main(){
	memsett();
	scanf("%d",&T);
	while(T--){
		int now;
		scanf("%d",&now);
		if(ex[now]){printf("-1\n"); continue;}
		int ans=now+1;
		while(ex[ans]==1) ans++;
		printf("%d\n",ans);
	}
	
	return 0;
}