1969

class Solution {
public:
    typedef long long ll;
    ll mod = 1000000007LL;

    int minNonZeroProduct(int p) {
        ll n = (1LL<<p)-1LL;
        ll prod = n;
        prod = prod%mod;
        prod = (prod*fpow(n-1, n/2))%mod;
        return prod;
    }

    ll fpow(ll x, ll y) {
        ll r = 1;
        x = x%mod;
        while(y > 0){
            if(y & 1)
                r = (r * x) % mod;
            y >>= 1;  x = (x * x) % mod;
        }
        return r%mod;
    }
};