<p>You are given an integer <code>n</code>. We reorder the digits in any order (including the original order) such that the leading digit is not zero.</p>

<p>Return <code>true</code> <em>if and only if we can do this so that the resulting number is a power of two</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> n = 1
<strong>Output:</strong> true
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> n = 10
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def reorderedPowerOf2(self, n: int) -> bool:
        from collections import Counter
        # Generate all powers of 2 up to the maximum possible with 10 digits
        powers_of_two = [Counter(str(1 << i)) for i in range(31)]
        # Count the digits of n
        n_counter = Counter(str(n))
        # Check if any of the power of 2 digit counts match n's digit counts
        return n_counter in powers_of_two
16400