A pangram is a sentence which contains every letter of the alphabet. A self-documenting pangram is one which follows the general format of:

This sentence contains <number> a's, <number> b's, <number> c's, ...

For example:

Only a fool would check that this sentence contains exactly six 'a's, one 'b', six 'c's, three 'd's, thirty-four 'e's, five 'f's, two 'g's, ten 'h's, thirteen 'i's, one 'j', two 'k's, five 'l's, one 'm', twenty-two 'n's, seventeen 'o's, one 'p', one 'q', seven 'r's, thirty-two 's's, twenty-six 't's, three 'u's, seven 'v's, eight 'w's, six 'x's, seven 'y's, and one 'z'.

Find the self documenting pangram that begins with "The solution to the Gaia problem contains precisely..."

You can use any of the following languages:
- PHP
- Perl
- Python
- Ruby
- C/C++
- C#
- Java
- Ocaml/SML/F#
- Haskell
- Lisp
- Malbolge

(PHP or Java are what we use here, but we love playing with all sorts of technology, so pick whatever you want).

Attach your solution to your resume and send it to:

0x41444b4b5d545b5e5342 @ gaiaonline.com

where every character in the hex number is the ASCII character xor 0x31.