문제<\/h2>
Dmitry has recently learned a simple rule to check if an integer is divisible by 3. An integer is divisible by 3 if the sum of its digits is divisible by 3.<\/p>
Later he also learned that the same rule can be used to check if an integer is divisible by 9. An integer is divisible by 9 if the sum of its digits is divisible by 9.<\/p>
Dmitry's elder sister Daria wants to trick him by showing that the same rule can be applied to any divisor $d<\/mi><\/mrow>d<\/math><\/span><\/span> d<\/span><\/span><\/span><\/span>. To do this, she wants to show Dmitry an example of a positive integer n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> such that n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> is divisible by d<\/mi><\/mrow>d<\/math><\/span><\/span> d<\/span><\/span><\/span><\/span>, and the sum of the digits of n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> is also divisible by d<\/mi><\/mrow>d<\/math><\/span><\/span>$

Divisibility Trick