Given a number n$,$ where $1<$ n $<80,$ your program should print all combinations of numbers

ABCDE$/$FGHIJ that yield n$.$ Here, the letters represent digits. Note that all digits $0.\mathrm{.}9$ must be

used. For example, for n $=62,$ we find that $79546/01283=62,$ and $94736/01528=62.$ Note

that leading zeroes are allowed, so A or F may be zero, but not both.

The input consists of a single line, containing the number n$.$ Your program should output

all divisions ABCDE$/$FGHIJ that yield n$.$ If multiple combinations exist, then these should be

printed in descending order for the number ABCDE. If no division is found, the program should

output NONE