discrete mathematics - Prove that $N times N$ is countable

$|N| = |N \times N|$ ($N \times N$ countable)

I tried to build a bijective function $f(n,m) \to n$. I saw some posts about this question but there wasn't any example nor a good explanation.