<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 {
public:
    bool check(int a,int b){
        vector<int> V(10,0);
        int r ;
        while(a){
            r = a%10;
            V[r]++;
            a = a/10;
        }
        while(b){
            r = b%10;
            V[r]--;
            b = b/10;
        }
        for(r=0;r<10;r++){
            if(V[r]!=0) return false;
        }
        return true;
    }
    bool reorderedPowerOf2(int n) {
        vector<int> V(10,0);
        int N = n;
        while(N){
            V[(N%10)]++;
            N = N/10;
        }
        int largest = 0;
        int i;
        for(i=9;i>=0;i--){
            while(V[i]--){
                largest = (largest*10) + i;
            }
        }
        int start = 1;
        while(start<=largest){
            if(check(start,n)==true){
                return true;
            }
            start = start*2;
        }
        return false;
    }
};
8000