Code in JavaScript, works for all test cases:

function processData(input) { //Enter your code here let lines = input.split("\n").slice(1); lines.forEach(line => { let n = parseInt(line);

    if (n < 2) {
        console.log("Not prime");
        return;
    }
    let isPrime = true;
    if (n % 2 === 0 && n !== 2) {
        isPrime = false;
    }
    let sqrtN = Math.floor(Math.sqrt(n));
    for (let i = 3; i <= sqrtN; i += 2) { // Skip even numbers
        if (n % i === 0) { 
        isPrime = false;
        break;
        }
    }
    console.log(isPrime ? "Prime" : "Not prime");
    });

}

python 3: import math

def is_prime(n): if n <= 1: print('Not prime') else: prime = True for i in range(2, int(math.sqrt(n))+1): if n % i == 0: prime = False break if prime: print('Prime') else: print('Not prime')

T=int(input())

for i in range(T): n = int(input()) is_prime(n)

include

include

const char* is_prime(int n) { if (n <= 1) { return "Not prime"; } if (n <= 3) { return "Prime"; } if (n % 2 == 0 || n % 3 == 0) { return "Not prime"; }

// Check for divisibility from 5 to sqrt(n)
for (int i = 5; i * i <= n; i += 6) {
    if (n % i == 0 || n % (i + 2) == 0) {
        return "Not prime";
    }
}
return "Prime";

}

int main() { int n; printf("Enter a number: "); scanf("%d", &n);

printf("%s\n", is_prime(n));

    return 0; }

t=int(input()) for _ in range(t): n=int(input()) if n<=1: print('Not prime') else: for i in range(2,int(n**0.5)+1): if(n%i)==0: print('Not prime') break else: print('Prime')

javaScript Solution

function processData(input) { const numbers = input.split('\n').slice(1).map(Number);

numbers.forEach(number => { console.log(isPrime(number) ? 'Prime' : 'Not prime'); }); }

function isPrime(num) { if (num <= 1) return false; if (num <= 3) return true; if (num % 2 === 0 || num % 3 === 0) return false;

for (let i = 5; i * i <= num; i += 6) { if (num % i === 0 || num % (i + 2) === 0) return false; }

return true; } `