Probability of having two cycles of length n/2 in an Erdős-Rényi graph?

Question

Given an Erdős-Rényi graph $\mathbb{G}(n,p)$ (that is, a random graph where each edge exists with probability $p$), what is the probability of having that a graph created according to $\mathbb{G}(n,p)$ contains exactly two cycles of length $n/2$ and no other edges (assume that $n$ is even for this)?