#include <stdio.h>
int main() {
int n, i, flag = 0;
printf("Enter a positive integer: ");
for (i = 2; i <= n / 2; ++i) {
// condition for non-prime
if (n % i == 0) {
flag = 1;
break;
}
}
if (n == 1) {
printf("1 is neither prime nor composite."); }
else {
if (flag == 0)
printf("%d is a prime number.", n
); else
printf("%d is not a prime number.", n
); }
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CmludCBtYWluKCkgewogICAgaW50IG4sIGksIGZsYWcgPSAwOwogICAgcHJpbnRmKCJFbnRlciBhIHBvc2l0aXZlIGludGVnZXI6ICIpOwogICAgc2NhbmYoIiVkIiwgJm4pOwoKICAgIGZvciAoaSA9IDI7IGkgPD0gbiAvIDI7ICsraSkgewoKICAgICAgICAvLyBjb25kaXRpb24gZm9yIG5vbi1wcmltZQogICAgICAgIGlmIChuICUgaSA9PSAwKSB7CiAgICAgICAgICAgIGZsYWcgPSAxOwogICAgICAgICAgICBicmVhazsKICAgICAgICB9CiAgICB9CgogICAgaWYgKG4gPT0gMSkgewogICAgICAgIHByaW50ZigiMSBpcyBuZWl0aGVyIHByaW1lIG5vciBjb21wb3NpdGUuIik7CiAgICB9CiAgICBlbHNlIHsKICAgICAgICBpZiAoZmxhZyA9PSAwKQogICAgICAgICAgICBwcmludGYoIiVkIGlzIGEgcHJpbWUgbnVtYmVyLiIsIG4pOwogICAgICAgIGVsc2UKICAgICAgICAgICAgcHJpbnRmKCIlZCBpcyBub3QgYSBwcmltZSBudW1iZXIuIiwgbik7CiAgICB9CgogICAgcmV0dXJuIDA7Cn0=