Ignatius's puzzle

                                                                                                            Ignatius puzzle

Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative integer k(k<10000),to find the minimal nonegative integer a,make the arbitrary integer x ,65|f(x)if
no exists that a,then print "no".

Input

The input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input.

Output

The output contains a string "no",if you can't find a,or you should output a line contains the a.More details in the Sample Output.

Sample Iutput

  
  

   
   11
100
9999
  
  

Sample Output

  
  

   
   22
no
43
  
  

释疑：根据第一个公式f(x)=5*x^13+13*x^5+k*a*x；及题目意思可知对于任何X满足，有归纳法可知只许证f(x+1)满足即可；证18+a*k；

满足即可,代码如下：

#include<stdio.h>
int main()
{
    int a,i,k;
    while(scanf("%d",&k)!=EOF)
    {
        for(a=1;a<=65;a++)
        {
            if((18+a*k)%65==0)
            {
                printf("%d\n",a);
                break;
            }
        }
        if(a>65)
            printf("no\n");
    }
    return 0;
}