solution for java 8 import java.io.; import java.util.;

public class Solution {

public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    Prime ob = new Prime();

    int a = scan.nextInt();
    int b = scan.nextInt();
    int c = scan.nextInt();
    int d = scan.nextInt();
    int e = scan.nextInt();

    ob.checkPrime(a);
    ob.checkPrime(a,b);
    ob.checkPrime(a,b,c);
    ob.checkPrime(a,b,c,d,e);

    scan.close();
}

}

class Prime{
    void checkPrime(int... numbers){
        for(int num: numbers){
            if(isPrime(num)){
                System.out.print(num + " ");
            }
        }
        System.out.println();
    }
    private boolean isPrime(int n){
        if(n < 2) return false;
        for(int i = 2; i <= Math.sqrt(n); i++){
            if(n % i == 0) return false;
        }
        return true;
    }
}