import java.util.*;
import java.io.*;
public class DWITE0910Round5Q2 {
    public static void main(String[] args) throws IOException {
        int nPrimesFound = 0, n = 0;
        int [] arnPrimes = new int[51];

        BufferedReader fin = new BufferedReader(new FileReader("DATA2.txt"));
        PrintWriter fout = new PrintWriter(new BufferedWriter(new FileWriter("OUT2.txt")));

        while(nPrimesFound < 50)
        {
            n++;
            if(isPrime(n) == true)
            {
                arnPrimes[nPrimesFound] = n;
                nPrimesFound++;
            }
        }

        for(int i = 0; i < 5; i++)
        {
            int nNum = Integer.parseInt(fin.readLine());

            for(int ii = 0; ii < 50; ii++)
            {
                int nBest = 0;
                if(arnPrimes[ii] > nNum)
                {
                    
                    if(ii - 2 < 0)
                        nBest = arnPrimes[ii + 1];
                    else
                    {
                        if(Math.abs(nNum - arnPrimes[ii - 2]) < Math.abs(nNum - arnPrimes[ii + 1]))
                        {
                            nBest = arnPrimes[ii  - 2];
                        }
                        else
                        {
                            nBest =  arnPrimes[ii + 1];
                        }
                    }

                    fout.println(nBest);
                    break;
                }
                else if (arnPrimes[ii] == nNum)
                {
                    if(ii - 2 < 0)
                        nBest = arnPrimes[ii + 2];
                    else
                    {
                        if(Math.abs(nNum - arnPrimes[ii - 2]) < Math.abs(nNum - arnPrimes[ii + 2]))
                        {
                            nBest = arnPrimes[ii  - 2];
                        }
                        else
                        {
                            nBest =  arnPrimes[ii + 2];
                        }
                    }

                    fout.println(nBest);
                    break;
                }
            }
        }

        fin.close();
        fout.close();
    }

    private static boolean isPrime(int n) {
        if(n == 0 || n == 1)
            return false;

        for(int i = n; i > 1; i--)
        {
            if(n % i == 0 && i != 1 && i != n)
                return false;
        }

        return true;
    }
}