#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main() {
    char eratoTable[5793];
    int primeCount = 0;
    int primeList[46340] = {0};
    int i, j;

    for (i = 0; i < 5793; eratoTable[i++] = 0);

    for (i = 2; i < 5793; i++) {
        if ( (eratoTable[i / 8] >> (i % 8)) & 1) continue;
        for (j = i * 2; j < 46340; j += i) {
            eratoTable[j / 8] = eratoTable[j / 8] | (1 << (j % 8));
        }
    }
    for (i = 2; i < 46340; i++) {
        if ( !(eratoTable[i / 8] >> (i % 8) & 1) ) {
            primeList[primeCount++] = i;
        }
    }
    primeList[primeCount] = 0x7fffffff;

    int input, sqrtInput;
    while (scanf("%d", &input) != EOF) {
        sqrtInput = (int)sqrt(input);
        for (i = 0; primeList[i] <= sqrtInput; i++) {
            if (input % primeList[i] == 0) {
                printf("非");
                break;
            }
        }
        printf("質數\n");
    }

    return 0;
}