An RSA number is a positive integer that is the product of two
distinct primes. For example, and are RSA numbers whereas , and
are not.
You are teaching a course that covers RSA cryptography. For
one assignment problem, you asked students to generate RSA
numbers. They were to submit two positive integers . Ideally, these would be
distinct prime numbers. But some students submitted incorrect
solutions. If they were not distinct primes, partial credit can
be earned if
is not an integer multiple of for any integer . If there is an integer
such that
divides , then the student receives
no credit.
For a pair of positive integers submitted by a student for
the assignment, determine if they should receive full credit,
partial credit, or no credit for this submission.
Note: In the sixth sample case below, the
number is divisible by
and in
the seventh sample case below, the number is
divisible by .
Input
The input consists of a single line containing two integers
() and
(), which are
the two submitted numbers.
Output
Display if the student should receive full credit, partial
credit, or no credit for the
submitted numbers.
Sample Input 1 |
Sample Output 1 |
13 23
|
full credit
|
Sample Input 2 |
Sample Output 2 |
35 6
|
partial credit
|
Sample Input 3 |
Sample Output 3 |
4 5
|
no credit
|
Sample Input 4 |
Sample Output 4 |
17 17
|
no credit
|
Sample Input 5 |
Sample Output 5 |
15 21
|
no credit
|
Sample Input 6 |
Sample Output 6 |
545528636581 876571629707
|
no credit
|
Sample Input 7 |
Sample Output 7 |
431348146441 3
|
no credit
|