Solve in Python:
A number `n` is called `prime happy` if there is at least one prime less than `n` and the `sum of all primes less than n` is evenly divisible by `n`. Write `isPrimeHappy(n)` which returns `true` if `n` is `prime happy` else `false`.
def isPrime(n): 
    for i in range(2,int(n**.5)+1): 
        if n%i == 0:
            return False
    return True 
def is_prime_happy(n):
    sum = 0
    for i in range(2,n): 
        if isPrime(i): 
            sum += i 
    if sum > 0 and not sum%n: 
        return True
    return False