#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii=pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c),end(c)
#define rall(c) rbegin(c),rend(c)
#define fore(x,c) for(auto &&x:c)
#define rep(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define rrep(i, a, n) for(int i=(int)(n-1);i>=a;--i)
#define sz(c) ((int)c.size())
#define contains(c,x) (c.find(x)!=end(c))
#define inseg(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(nullptr); ios::sync_with_stdio(0);
        cout << setprecision(15) << fixed;
        // #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

// 1-indexed
struct BIT {
    int size;
    int pow2_less;
    vector<int> data;
    BIT(int n): size(n + 1), data(n + 1, 0) {
        pow2_less = 1;
        while ((pow2_less << 1) <= size)
            pow2_less <<= 1;
    }
    void add(int i, int x) {
        while (i < size) {
            data[i] += x;
            i += i & -i;
        }
    }
    int sum(int i) {
        int ret = 0;
        while (i > 0) {
            ret += data[i];
            i -= i & -i;
        }
        return ret;
    }
    // sum(x) >= w となる最小のxを返す
    int lower_bound(int w) {
        if (w <= 0) return 0;
        int x = 0;
        for (int k = pow2_less; k > 0; k >>= 1) {
            if (x + k < size && data[x + k] < w) {
                w -= data[x + k];
                x += k;
            }
        }
        return x + 1;
    }
};
signed main() {
    int N;
    cin >> N;
    N = 1 << N;
    vi S(N);
    cin >> S;
    sort(all(S));

    auto compress = S;
    compress.erase(unique(all(compress)), compress.end());
    auto get_idx = [&](int x) { return lower_bound(all(compress), x) - compress.begin() + 1; };

    BIT bit(N + 1);
    rep(i, 0, N) {
        bit.add(get_idx(S[i]), 1);
        S[i] = get_idx(S[i]);
    }

    priority_queue<int> started;
    started.push(S.back());
    bit.add(S.back(), -1);

    rep(i, 0, N) {
        if (sz(started) == N) break;
        priority_queue<int> next_started = started;
        while (sz(started)) {
            int x = started.top(); started.pop();
            int s = bit.sum(x - 1);
            int y = bit.lower_bound(s);
            if (y == 0) {
                cout << "No" << endl;
                return 0;
            }
            next_started.push(y);
            bit.add(y, -1);
        }
        started.swap(next_started);
    }

    cout << "Yes" << endl;
    return (0^_^0);
}



Measured memory_bytes: 9580