RSA

Problem Description

The RSA algorithm chooses the product of two distinct primes as the modulus. Now you are given two positive integers $A, B$. If they are two distinct primes, output full credit; otherwise, if $A \cdot B$ is not divisible by the square of any integer greater than $1$, output partial credit; otherwise output no credit.

Input Format

A single line containing two positive integers $A, B$.

Output Format

Output full credit, partial credit, or no credit.

Sample Input 1

13 23

Sample Output 1

full credit

Sample Input 2

3 3

Sample Output 2

no credit

Constraints

For all data, $2 \le A, B \le 10^{12}$.