A data scientist is analyzing a secure hash algorithm that produces integer outputs defined by the function $H(n)=n^2+14$, where $n$ is any integer. Use the method of proof by contradiction to show that it is impossible for any hash output $H(n)$ to be exactly divisible by 4.