checking all the coefficients whether they are divisible by n or not . if n is not prime , then loop breaks and ( i > 0 ) .
i = n ; NEW_LINE while ( i > - 1 and c [ i ] % n == 0 ) : NEW_LINE INDENT i = i - 1 ; NEW_LINE DEDENT