Hello hacker,

It is Valentine's Day and you want to impress your big love, Valentina.
She is into programming and math, so you want to prove the Goldbach theorem to impress her.
You come up with an idea:
The tehron's number!
The tehron's number is the number of combinations to build an even number out of two prime summands.
Example:

tehrons_number(4) = 1 (2+2)
tehrons_number(6) = 1 (3+3)
tehrons_number(8) = 1 (3+5)
tehrons_number(10) = 2 (3+7, 5+5)
tehrons_number(12) = 1 (5+7)

You analyze a bigger set of numbers to work on your proof...

The solution to this challenge is a hash.
Concatenate all tehron's numbers from 4 to 31415926 as a string, and build the md5 hash out of it.

In the example above, from 4 to 12, the solution would be md5('11121');

Have a nice Valentine's Day
- gizmore and tehron