#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;


long long int mod(long long x,long long n,long long int m)
{
    if(n==0)
        return 1;
    if(n%2==1)
        return (((x%m)*mod(x,n-1,m))%m);
    else
    {
        long long int d=mod(x,n/2,m);
        return (((d%m)*(d%m))%m);
    }
}


int main()
{
    ll i,j,k,l,a,b,c,d,e,n,m;
    while(cin>>n && n)
    {
        bool flag=true;
        for(i=2; i*i<=n; i++)
        {
            if(n%i==0)
            {
                flag=false;
                break;
            }
        }
        if(flag)
        {
            cout<<n<<" is normal."<<endl;
            continue;
        }
        flag=true;
        for(i=2; i<n; i++)
        {
            if(mod(i,n,n)!=i)
            {
                flag=false;
                break;
            }
        }
        if(flag)
            cout<<"The number "<<n<<" is a Carmichael number."<<endl;

        else
            cout<<n<<" is normal."<<endl;

    }
    return 0;
}