Hector the hacker has stolen some information, but it is encrypted. In order to decrypt it, he needs to write a function that will generate a decryption key from the encryption key which he stole (it is in hexadecimal). To do this, he has to determine the two prime factors `P` and `Q` of the encyption key, and return the product `(P-1) * (Q-1)`.
**Note:** the primes used are < 10^(5)
## Examples
For example if the encryption key is `"47b"`, it is 1147 in decimal. This factors to 31\*37, so the key Hector needs is 1080 (= 30\*36).
More examples:
* input: `"2533"`, result: 9328 (primes: 89, 107)
* input: `"1ba9"`, result: 6912 (primes: 73, 97)
def find_key(encryption_key):
    is_prime=lambda p:all(p%i for i in range(3,int(p**0.5)+1,2)) and (p==2 or p%2)
    n=int(encryption_key,16)
    if n%2==0 and is_prime(n//2):return n//2-1
    for i in range(3,n+1,2):
        if n%i==0 and is_prime(i) and is_prime(n//i):
            return (i-1)*(n//i-1)
def find_key(encryption_key):
    is_prime=lambda p:all(p%i for i in range(3,int(p**0.5)+1,2)) and (p==2 or p%2)
    n=int(encryption_key,16)
    if n%2==0 and is_prime(n//2):return n//2-1
    for i in range(3,n+1,2):
        if n%i==0 and is_prime(i) and is_prime(n//i):
            return (i-1)*(n//i-1)