"""
Project Euler problem 145: https://projecteuler.net/problem=145
Author: Vineet Rao, Maxim Smolskiy
Problem statement:

Some positive integers n have the property that the sum [ n + reverse(n) ]
consists entirely of odd (decimal) digits.
For instance, 36 + 63 = 99 and 409 + 904 = 1313.
We will call such numbers reversible; so 36, 63, 409, and 904 are reversible.
Leading zeroes are not allowed in either n or reverse(n).

    * Tru64 support.
  Monty Taylor <******@****.***>
    * Solaris 10 + Sun Studio fixes.
  Alek Storm <******@****.***>
    * Slicing support for repeated scalar fields for the Python API.
  Oleg Smolsky <oleg.smolsky@gmail.com>
    * MS Visual Studio error format option.
    * Detect unordered_map in stl_hash.m4.
  Brian Olson <******@****.***>
    * gzip/zlib I/O support.
  Michael Poole <******@****.***>