diff --git a/algorithms/simon/simon.ipynb b/algorithms/simon/simon.ipynb
index 342b2d02b..6441edca0 100644
--- a/algorithms/simon/simon.ipynb
+++ b/algorithms/simon/simon.ipynb
@@ -88,6 +88,7 @@
     "### Classical Postprocess\n",
     "\n",
     "The classical part of the algorithm includes the following postprocessing steps:\n",
+    "\n",
     "1. Finding $N-1$ samples of $x$ that are linearly independent, $\\{y_k\\}^{n-1}_{1}$. It is guaranteed that this can be achieved with high probability (see the [technical details](#The-classical-part) below).\n",
     "2. Finding the string $s$ such that $s \\cdot y_k=0 \\,\\,\\, \\forall k$, where $\\cdot$ refers to a dot-product mod 2 (polynomial complexity in $N$).\n",
     "\n",