"""
For a positive integer <var>n</var> and digits <var>d</var> we define 
F<var>n</var> <var>d</var> as the number of the divisors of <var>n
</var> whose last digits equal <var>d</var>
For example F84 4  3 Among the divisors of 84 1 2 3 4 6 7 12 14 21 28 
42 84 three of them 4 14 84 have the last digit 4

We can also verify that F12 12  11 and F50 123  17888

Find F10<sup>6</sup> 65432 modulo 10<sup>16</sup>  61
"""

def euler474():
    """
    >>> euler474()
    'to-do'
    """
    pass

if __name__ == "__main__":
    import doctest
    doctest.testmod()