import java.util.*;

class Prime { void checkPrime(int... numbers) { for (int i = 0; i < numbers.length; i++) { int num = numbers[i]; int count = 0;

        if (num < 2) {
            continue;
        }

        for (int j = 1; j <= num; j++) {
            if (num % j == 0) {
                count++;
            }
        }

        if (count == 2) {
            System.out.print(num + " ");
        }
    }
    System.out.println();
}

}

public class Solution { public static void main(String[] args) { Scanner scanner = new Scanner(System.in);

    int n1 = scanner.nextInt();
    int n2 = scanner.nextInt();
    int n3 = scanner.nextInt();
    int n4 = scanner.nextInt();
    int n5 = scanner.nextInt();

    Prime prime = new Prime();

    prime.checkPrime(n1);
    prime.checkPrime(n1, n2);
    prime.checkPrime(n1, n2, n3);
    prime.checkPrime(n1, n2, n3, n4, n5);

    scanner.close();
}

}