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

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

    for (i = 2; i <= n / 2; ++i)
    {
        if (n % i == 0)
        {
            flag = 1;
            break;
        }
    }

    return flag;
}

int checkArmstrongNumber(int num)
{

    int n, r, result = 0, flag = 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)
    {
        flag = 1;
    }

    return flag;
}

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

    prime = checkPrimeNumber(number);
    if (prime == 0)
    {
        printf("The number is a Prime number.\n");
    }
    else
    {
        printf("The number is a non-Prime number.\n");
    }

    armstrong = checkArmstrongNumber(number);
    if (armstrong == 1)
    {
        printf("The number is a Armstrong number.\n");
    }
    else
    {
        printf("The number is not an Armstrong number.\n");
    }

    return 0;
}