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

void checkPrimeNumber(int n)
{
    int i, flag = 0;

    for (i = 2; i <= n / 2; ++i)
    {
        if (n % i == 0)
        {
            printf("The number %d is non-prime.\n", n);
            flag = 1;
            break;
        }
    }
    if (flag == 0)
    {
        printf("The number %d is prime.\n", n);
    }
}

void checkArmstrongNumber(int num)
{
    int n, r, result = 0;
    n = num;

    while (n != 0)
    {
        // remainder contains the last digit
        r = n % 10;

        result += r * r * r;

        // removing last digit from the orignal number
        n /= 10;
    }

    if (result == num)
    {
        printf("%d is an Armstrong number.\n", num);
    }
    else
    {
        printf("%d is not an Armstrong number.\n", num);
    }
}

int main()
{
    int number;
    printf("Enter the number: ");
    scanf("%d", &number);

    checkPrimeNumber(number);
    checkArmstrongNumber(number);

    return 0;
}