#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
int prime[70000];
void is_prime()
{
for(int i=2;i<=70000;i++) {
if(!prime[i]) {
for(int j=2*i;j<=70000;j+=i) prime[j]=1;
}
}
}
ll mod_pow(ll x,ll n,ll mod)
{
ll res=1;
while(n>0) {
if(n&1) res=res*x%mod;
x=x*x%mod;
n>>=1;
}
return res;
}
int main()
{
int i,j,n,x;
is_prime();
while(cin>>n && n) {
if(!prime[n]) {
printf("%d is normal.\n",n);
continue;
}
for(x=2;x<n;x++) {
if(mod_pow(x,n,n)!=x%n) break;
}
if(x==n) printf("The number %d is a Carmichael number.\n",n);
else printf("%d is normal.\n",n);
}
return 0;
}