Define a "prime prime" number to be a rational number written as one prime number over another prime number: `primeA / primeB` (e.g. `7/31`)
Given a whole number `N`, generate the number of "prime prime" rational numbers less than 1, using only prime numbers between `0` and `N` (non inclusive).
Return the count of these "prime primes", and the integer part  of their sum.
## Example
```python
N = 6
# The "prime primes" less than 1 are:
2/3, 2/5, 3/5               # count: 3
2/3 + 2/5 + 3/5 = 1.6667    # integer part: 1
Thus, the function should return 3 and 1.
```
def prime_primes(n):
    sieve = [0, 0] + [1] * (n - 2)
    for k in range(2, int(n ** .5) + 1):
        if sieve[k]: sieve[k*k::k] = ((n-k*k-1) // k + 1) * [0]
    primes = [p for p, b in enumerate(sieve) if b]
    ratios = [b / a for i, a in enumerate(primes) for b in primes[:i]]
    return len(ratios), int(sum(ratios))
def prime_primes(n):
    sieve = [0, 0] + [1] * (n - 2)
    for k in range(2, int(n ** .5) + 1):
        if sieve[k]: sieve[k*k::k] = ((n-k*k-1) // k + 1) * [0]
    primes = [p for p, b in enumerate(sieve) if b]
    ratios = [b / a for i, a in enumerate(primes) for b in primes[:i]]
    return len(ratios), int(sum(ratios))