// :#define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
// #include "../debug/debug.cpp"
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

V<ll> id_v;

ll get_id(ll val) {
    auto ite = lower_bound(ALL(id_v), val);
    return distance(id_v.begin(), ite);
}

template <typename T>
class SegmentTree {
public:
    ll size;
    vector<T> node;
    function<T(T, T)> comp;
    T identity_ele;  //comp(x, identity_ele) == x

    SegmentTree(const vector<T> &v, function<T(T, T)> comp, T identity_ele) 
        : comp(comp),
          identity_ele(identity_ele)
    {
        ll tmp = 1;
        while(tmp < v.size()) tmp = (tmp << 1);
        this->size = tmp;
        this->identity_ele = identity_ele;
        this->comp = comp;
        node = V<T>(2 * size - 1, identity_ele);
        for(ll i = 0; i < v.size(); i++) {
            node[i + size - 1] = v[i];
        }
        for(ll i = size - 2; 0 <= i; i--) {
            node[i] = comp(node[i * 2 + 1], node[i * 2 + 2]);
        }
    }

    void update(ll pos, T value) {
        pos += size - 1;
        node[pos] = value;
        while(pos > 0) {
            pos = (pos - 1) / 2;
            node[pos] = comp(node[2 * pos + 1], node[2 * pos + 2]);
        }
    }

    T query(ll a, ll b) {
        return sub_query(a, b, 0, 0, size);
    }

    T sub_query(ll a, ll b, ll k, ll l, ll r) {
        if(r <= a || b <= l) {
            return identity_ele;
        } else if(a <= l && r <= b) {
            return node[k];
        } else {
            T left = sub_query(a, b, k * 2 + 1, l, (l + r) / 2);
            T right = sub_query(a, b, k * 2 + 2, (l + r) / 2, r);
            return comp(left, right);
        }
    }

    ll bin_search(ll val, ll k, ll l, ll r) {
        if(r - l == 1) {
            node[k]--;
            return l;
        }
        ll mid = (r + l) / 2;
        if(mid < val && node[2 * k + 2]) {
            ll ret = bin_search(val, 2 * k + 2, mid, r);
            if(ret != -1) {
                node[k]--;
                return ret;
            }
        }
        if(l < val && node[2 * k + 1]) {
            ll ret = bin_search(val, 2 * k + 1, l, mid);
            if(ret != -1) {
                node[k]--;
                return ret;
            }
        }
        return -1;
    }

    ll bin_search(ll val) { return bin_search(val, 0, 0, size); }
};

bool solve() {
    ll N;
    cin >> N;
    ll max_v = 0;
    V<ll> S(1ll << N);
    for(auto &&ele : S) {
        cin >> ele;
        chmax(max_v, ele);
    }
    {
        id_v = S;
        sort(ALL(id_v));
        auto ite = unique(ALL(id_v));
        id_v.erase(ite, id_v.end());
    }
    V<ll> init_v(id_v.size() + 10);
    for(auto &&ele : S) init_v[get_id(ele)]++;
    V<ll> cur = { get_id(max_v) };
    init_v[get_id(max_v)]--;
    DEBUG(init_v);
    SegmentTree<ll> st(init_v, [](ll a, ll b) { return a + b; }, 0);
    for(ll i = 1; i <= N; i++) {
        auto size = cur.size();
        for(ll j = 0; j < size; j++) {
            ll res = st.bin_search(cur[j]);
            DEBUG(cur[j], res);
            if(res == -1) return false;
            cur.push_back(res);
        }
    }
    return true;
}

int main() {
    cout << (solve() ? "Yes" : "No") << endl;
    return 0;
}


Measured memory_bytes: 16756