#include<iostream>
#include<cstdio>
#include<cstring>
#define MAX 70
#include<algorithm>
using namespace std;
//实现dig1和dig2的字符串加法,结果更新dig1
//返回true运算成功,返回false说明得到的字符串长度大于len
bool AddSelfOnce(char dig1[],char dig2[],int len);
char digit[MAX];
char exDigit[MAX*2];
char temp[MAX];
int main()
{
int i,len;
while(cin>>digit)
{
len=strlen(digit);
for(i=0; i<2*len; i++) //初始化temp和exDigit
{
exDigit[i]=digit[i%len];
if(i<len)temp[i]=digit[i];
else if(i==len)temp[i]=NULL;
}
exDigit[i]=NULL;
for(i=2; i<=len; i++)
{
if(!AddSelfOnce(temp,digit,len))
{
cout<<digit<<" is not cyclic"<<endl;
break;
}
if(strstr(exDigit,temp)==NULL) //如果temp不是exDigit的子串
{
cout<<digit<<" is not cyclic"<<endl;
break;
}
}
if(i>len)cout<<digit<<" is cyclic"<<endl;
}
return 0;
}
bool AddSelfOnce(char dig1[],char dig2[],int len)
{
int i,carry=0;
for(i=len-1; i>=0; i--)
{
dig1[i]+=(dig2[i]+carry-48);
if(dig1[i]>'9')
{
if(0==i)
return false;
dig1[i]-=10;
carry=1;
}
else carry=0;
}
return true;
}