#include <stdio.h>
 
int main() {
    int n, c = 0, i;
 
    printf("Enter an integer: ");
    scanf("%d", &n);
 
    for (i = 1; i <= n; i++) {  // Check all numbers from 1 to n
        if (n % i == 0) {
            c++;  // Increment count if n is divisible by i
        }
    }
 
    if (c == 2) {
        printf("%d is a prime number\n", n);  // A prime number has exactly 2 divisors: 1 and itself
    } else {
        printf("%d is not a prime number\n", n);
    }
 
    return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbigpIHsKICAgIGludCBuLCBjID0gMCwgaTsKICAgIAogICAgcHJpbnRmKCJFbnRlciBhbiBpbnRlZ2VyOiAiKTsKICAgIHNjYW5mKCIlZCIsICZuKTsKICAgIAogICAgZm9yIChpID0gMTsgaSA8PSBuOyBpKyspIHsgIC8vIENoZWNrIGFsbCBudW1iZXJzIGZyb20gMSB0byBuCiAgICAgICAgaWYgKG4gJSBpID09IDApIHsKICAgICAgICAgICAgYysrOyAgLy8gSW5jcmVtZW50IGNvdW50IGlmIG4gaXMgZGl2aXNpYmxlIGJ5IGkKICAgICAgICB9CiAgICB9CiAgICAKICAgIGlmIChjID09IDIpIHsKICAgICAgICBwcmludGYoIiVkIGlzIGEgcHJpbWUgbnVtYmVyXG4iLCBuKTsgIC8vIEEgcHJpbWUgbnVtYmVyIGhhcyBleGFjdGx5IDIgZGl2aXNvcnM6IDEgYW5kIGl0c2VsZgogICAgfSBlbHNlIHsKICAgICAgICBwcmludGYoIiVkIGlzIG5vdCBhIHByaW1lIG51bWJlclxuIiwgbik7CiAgICB9CiAgICAKICAgIHJldHVybiAwOwp9Cg==