Wilson primes satisfy the following condition.
Let ```P``` represent a prime number. 
Then ```((P-1)! + 1) / (P * P)``` should give a whole number.
Your task is to create a function that returns ```true``` if the given number is a Wilson prime.

def am_i_wilson(n):
    L = [5,13,563]
    return n in L

def am_i_wilson(n):
    L = [5,13,563]
    return n in L