def is_prime(n): if n == 1: return False for f in range(2, n): if n % f == 0: return False return True def twin_primes(p, q): return (abs(p - q) == 2) and is_prime(p) and is_prime(q)