Find the smallest positive integer *N* such that the (decimal) digits of *N*
and the (decimal) digits of 2*N* together consist of the digits 0,1,...,9 with
no repeats. Please try to reason this through; avoid just writing a program to solve it
by brute force.

Can you find examples in number bases other than 10?