diff --git a/Makefile b/Makefile
index de70501923f5228e50c37c3136bbcb448720a63d..cb93e6a73146292da9cac7c90663ad0958982140 100755
--- a/Makefile
+++ b/Makefile
@@ -7,4 +7,4 @@ bbl: paper.tex
 	bibtex paper.aux
 
 paper.tex:
-	pandoc -s --filter pandoc-fignos --filter pandoc-citeproc --filter pandoc-crossref --natbib paper.md -o paper.tex --bibliography paper.bib --template revtex.template
+	pandoc -s --filter pandoc-fignos --filter pandoc-citeproc --filter pandoc-crossref --natbib paper.md -o paper.tex --bibliography paper.bib --listings -H listings-setup.tex --template revtex.template
diff --git a/paper.md b/paper.md
index cf616447ca322026ba8e912544db99936f836dae..231d6aca3d0ae16f41b4ae9bca6d27c7206c401e 100755
--- a/paper.md
+++ b/paper.md
@@ -144,6 +144,10 @@ When querying $n>1$ points, the former procedure simply repeats $n$ times.
 
 #### A failure mode of such algorithms is sampling only a small neighborhood of one point.
 <!-- example of distance loss on singularities -->
+```python
+import adaptive
+
+```
 
 #### A solution is to regularize the loss such that this would be avoided.
 <!-- like resolution loss which limits the size of an interval -->