From ef537db68813ebaae11f54b780f21ad7dac05845 Mon Sep 17 00:00:00 2001
From: Benjamin Peterson <benjamin@python.org>
Date: Tue, 6 Sep 2016 14:32:40 -0700
Subject: [PATCH] improve grammar

---
 Doc/library/hashlib-blake2.rst | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Doc/library/hashlib-blake2.rst b/Doc/library/hashlib-blake2.rst
index 22efe696af5..aca24b42112 100644
--- a/Doc/library/hashlib-blake2.rst
+++ b/Doc/library/hashlib-blake2.rst
@@ -370,8 +370,8 @@ Here's an example of hashing a minimal tree with two leaf nodes::
       /  \
      00  01
 
-The example uses 64-byte internal digests, and returns the 32-byte final
-digest.
+This example uses 64-byte internal digests, and returns the 32-byte final
+digest::
 
     >>> from hashlib import blake2b
     >>>