var p:array[0..trunc(1e6)] of boolean;
    t,n:longint;
procedure sieve(n:longint);
var i,j:longint;
begin
for i := 2 to trunc(sqrt(n)) do
 if not p[i] then
   for j := i to n div i do p[i*j] := true;
end;
begin
assign(input,'SNTLN.inp');reset(input);
assign(output,'SNTLN.out');rewrite(output);
sieve(trunc(1e6));
readln(t);
while t <> 0 do
  begin
    readln(n);
    while p[n] do dec(n);
    writeln(n);
    dec(t);
  end;
close(input);close(output);
end.

uses crt;
type int = longint;
var
    cnt, t, n: int;
    pr, lpf: array[0..1000000] of int;

procedure linear_sieve(n: int);
var i, j: int;
begin
    for i:=2 to n do begin
        if lpf[i] = 0 then begin
            inc(cnt); pr[cnt]:=i;
            lpf[i]:=i;
        end;
        
        for j:=1 to cnt do begin
            if (pr[j] > lpf[i]) or (i * pr[j] > n) then break;
            lpf[i * pr[j]]:=pr[j];
        end;
    end;
end;

function prime(n: int): boolean; begin exit(lpf[n] = n); end;

begin
    clrscr;
    linear_sieve(trunc(1e6));
    readln(t);
    while t > 0 do begin
        dec(t);
        readln(n);
        while not prime(n) do dec(n);
        writeln(n);
    end;
readln;
end.