#include <stdio.h>
#include <stdbool.h>
 
// Function to check if a number is prime
bool isPrime(int num) {
    if (num <= 1) return false;
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) return false;
    }
    return true;
}
 
int main() {
    int numbers[] = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20};
    int size = sizeof(numbers) / sizeof(numbers[0]);
 
    printf("Prime numbers in the list: ");
    for (int i = 0; i < size; i++) {
        if (isPrime(numbers[i])) {
            printf("%d ", numbers[i]);
        }
    }
    printf("\n");
 
    return 0;
}

I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRib29sLmg+CgovLyBGdW5jdGlvbiB0byBjaGVjayBpZiBhIG51bWJlciBpcyBwcmltZQpib29sIGlzUHJpbWUoaW50IG51bSkgewogICAgaWYgKG51bSA8PSAxKSByZXR1cm4gZmFsc2U7CiAgICBmb3IgKGludCBpID0gMjsgaSAqIGkgPD0gbnVtOyBpKyspIHsKICAgICAgICBpZiAobnVtICUgaSA9PSAwKSByZXR1cm4gZmFsc2U7CiAgICB9CiAgICByZXR1cm4gdHJ1ZTsKfQoKaW50IG1haW4oKSB7CiAgICBpbnQgbnVtYmVyc1tdID0gezIsIDMsIDQsIDUsIDYsIDcsIDgsIDksIDEwLCAxMSwgMTIsIDEzLCAxNCwgMTUsIDE2LCAxNywgMTgsIDE5LCAyMH07CiAgICBpbnQgc2l6ZSA9IHNpemVvZihudW1iZXJzKSAvIHNpemVvZihudW1iZXJzWzBdKTsKCiAgICBwcmludGYoIlByaW1lIG51bWJlcnMgaW4gdGhlIGxpc3Q6ICIpOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBzaXplOyBpKyspIHsKICAgICAgICBpZiAoaXNQcmltZShudW1iZXJzW2ldKSkgewogICAgICAgICAgICBwcmludGYoIiVkICIsIG51bWJlcnNbaV0pOwogICAgICAgIH0KICAgIH0KICAgIHByaW50ZigiXG4iKTsKCiAgICByZXR1cm4gMDsKfQ==