Return the next higher prime number

// This challenge is a little bit more complex

// Write a function that takes a number (a) as argument

// If a is prime, return a

// If not, return the next higher prime number