Suahail Prime

#include <stdio.h>
#include <math.h>

int main() {


  int n, is_prime = 0 ;

  printf("Enter a whole number: ");
  scanf("%d", &n);

  for (int i = 2; i <= sqrt(n); ++i) {
    if (n % i == 0) {
      is_prime = 1;
      break;
    }
  }

  if (n == 1) {
    printf("1 is neither prime nor composite.");
  }

  else {
    if ( !is_prime)
      printf("%d is a prime number.", n);
    else
      printf("%d is not a prime number.", n);
  }

  return 0;
}