I need some insight in how to break the following RSA problem:

> 
> From an RSA encryption scheme you know that the algorithm that
>  generated the RSA modulus $N$ always outputs moduli of the form $N = pq$ such that the difference between $q^2$ and $p$ is not bigger than $2^8$
>  in absolute value.
> 
> 
> 

My question is: Shall I try to factor $N$? Which method should I use if so?

Somewhat related is [this](https://crypto.stackexchange.com/questions/5262/rsa-and-prime-difference) question. 

**Edit:**   

Solving for $q$, I have that $q$ is between the square root of $p-2^8$ and the square root of $p+2^8$.