<s>[INST] Write me a function in JavaScript that takes an array of 5 numbers as input and checks if any of the numbers is a valid prime number, if it is print the number to the console. [/INST] Sure, here is a function which 
```
// identify prime numbers
function isPrime(num) {
  if (num <= 1) {
    return false;
  }
  if (num === 2) {
    return true;
  }
  for (let i = 2; i < num; i++) {
    if (num % i === 0) {
      return false;
    }
  }
  return true;
}

// check if array contains prime numbers
function containsPrimes(arr) {
  if (!Array.isArray(arr) || typeof(arr[0]) !== 'number') {
    return;
  }
  for (let i = 0; i < arr.length; i++) {
    if (isPrime(arr[i])) {
      console.log(`${arr[i]} is a prime number`);
    }
  }
}
```</s>