Square of Hamilton cycle in a random graph

We show that $p=\sqrt{\frac{e}{n}}$ is a sharp threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle. This improves the previous results of K"uhn and Osthus and also Nenadov and \v{S}kori'c.