// Arup Guha
// 9/21/2011
// Written in COP 3223 to illustate the break statement and
// show how to check for primality.

#include <stdio.h>

int main() {

    // Get a number.
    int n;
    printf("Enter a number.\n");
    scanf("%d", &n);

    // Try dividing it by each integer, starting at 2.
    int div;
    for (div=2; div<n; div++)

        // If we found a divisor, it's not prime.
        if (n%div == 0)
            break;

    // Print out the appropriate message.
    if (div < n)
        printf("Your number is %d NOT prime.\n", n);
    else
        printf("Your number %d is prime.\n", n);

    return 0;
}