Negative time complexity?
The big O notations describes the complexity when $N$ approaching infinity, it is not a formula giving you exact running time for all $N$. 

Roughly, let $f(N)$ be the function for the running time of the algorithm, the big O notation says that there exists $n$ and a constant $c$ such that 
 $f(N)&lt;c\cdot (\log N)^2(\log\log N)(\log\log\log N)$ for all $N&gt;n$.