#include #define ll long long using namespace std; int a[78498]; void soe() { bool prime[1000001]; memset(prime, true, sizeof(prime)); for (int p=2; p*p<=1000000; p++) { if (prime[p] == true) { for (int i=p*2; i<=1000000; i += p) prime[i] = false; } } int i = 0; for (int p=2; p<=1000000; p++) if (prime[p]){ a[i] = p; i++; } } int main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin>>n; soe(); while(n--){ int b; cin>>b; int i = 0; while(b>=a[i]){ // cout<