Factoring Challenge

The goal is to factor a given 127/128-bit integer N of the form N = P*Q, where P and Q are two 64 bit primes. It is well-known that factorization is a hard problem, and hence you are provided with partial information about the bit-pattern of the primes P and Q. In particular, you are given about 50% of the bits of both P and Q, at random. The goal is to factor N by reconstructing the missing bits