Given an integer n, determine whether there exists a valid permutation of the digits of n that is equal to the sum of the factorials of its digits.

A permutation of digits is considered valid if it does not have leading zeros.

Constraints:

• $1 \leq$ n $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.