#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

struct SCC {
    int V, K;
    vector<vector<int>> G;
    vector<vector<int>> rG;
    vector<int> vs;
    vector<int> used;
    vector<int> cmp;
    SCC() { V=K=-1; }
    SCC(int V_): V(V_), G(V_), rG(V_), used(V_), cmp(V_) {}
    void add_edge(int from,int to) {
        G[from].push_back(to);
        rG[to].push_back(from);
    }
    void dfs(int v) {
        used[v]=true;
        for(int nx: G[v]) if(!used[nx]) dfs(nx);
        vs.push_back(v);
    }
    void rdfs(int v,int k) {
        used[v]=true; cmp[v]=k;
        for(int nx: rG[v]) if(!used[nx]) rdfs(nx,k);
    }
    int scc() {
        used.assign(V,0); vs.clear();
        for(int v=0;v<V;v++) if(!used[v]) dfs(v);
        used.assign(V,0);
        int k=0;
        for(int i=(int)vs.size()-1;i>=0;i--) if(!used[vs[i]]) {
            rdfs(vs[i],k++);
        }
        return K=k;
    }
    // O(ElogE)
    // SCCしたあとのグラフはトポロジカル順になってる
    vector<vector<int>> getDAG() {
        vector<vector<int>> res(K);
        for(int from=0;from<V;from++) {
            for(int to:G[from]) if(cmp[from]!=cmp[to]) {
                res[cmp[from]].push_back(cmp[to]);
            }
        }
        for(int i=0;i<K;i++){
            sort(ALL(res[i]));
            res[i].erase(unique(ALL(res[i])),res[i].end());
        }
        return res;
    }
};

struct twoSAT {
    ll n;
    SCC graph;
    vector<bool> ans;
    twoSAT(ll n) : n(n), graph(n*2), ans(n) {}
    // not なら false
    void add(pair<ll,bool> a0, pair<ll,bool> b0) {
        ll a = a0.first, ar = (a0.first+n)%(2*n);
        ll b = b0.first, br = (b0.first+n)%(2*n);
        if(!a0.second) swap(a, ar);
        if(!b0.second) swap(b, br);
        graph.add_edge(ar, b);
        graph.add_edge(br, a);
    }
    bool solve() {
        graph.scc();
        REP(i, n) if(graph.cmp[i] == graph.cmp[n+i]) return false;
        REP(i, n) ans[i] = graph.cmp[i] > graph.cmp[n+i];
        return true;
    }
};

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, x, a, o;
    cin >> n >> x >> a >> o;

    if(x == 0) {
        cout << "No" << endl;
        return 0;
    }

    const ll m = 1LL<<(n+1);
    twoSAT sat(m);
    // xor
    REP(i, m) {
        sat.add({i, false}, {x^i, false});
        sat.add({i, true}, {x^i, true});
    }
    // and
    REP(i, m) {
        if((i&a)!=a) continue;
        ll sub = (m-1)^i;
        while(true) {
            sat.add({i, false}, {a^sub, false});
            if(sub == 0) break;
            sub = (sub-1) & ((m-1)^i);
        }
    }
    // or
    REP(i, m) {
        if((i|o)!=o) continue;
        ll sub = i;
        while(true) {
            sat.add({i, false}, {((~i)&o)^sub, false});
            if(sub == 0) break;
            sub = (sub-1) & i;
        }
    }

    if(!sat.solve()) {
        cout << "No" << endl;
        return 0;
    }
    cout << "Yes" << endl;
    vector<ll> ret;
    REP(i, m) if(sat.ans[i]) ret.push_back(i);
    REP(i, m/2) cout << ret[i] << (i==m/2-1?'\n':' ');

    // // xor
    // REP(i, m) {
    //     if(sat.ans[i] && sat.ans[x^i]) {
    //         cout << "xor: " << bitset<4>(i) << " " << bitset<4>(x^i) << endl;
    //     }
    // }
    // // and
    // REP(i, m) {
    //     if((i&a)!=a) continue;
    //     ll sub = (m-1)^i;
    //     while(true) {
    //         if(sat.ans[i] && sat.ans[(i&a)^sub]) {
    //             cout << "and: " << bitset<4>(i) << " " << bitset<4>((i&a)^sub) << endl;
    //         }
    //         if(sub == 0) break;
    //         sub = (sub-1) & ((m-1)^i);
    //     }
    // }
    // // or
    // REP(i, m) {
    //     if((i|o)!=o) continue;
    //     ll sub = i;
    //     while(true) {
    //         if(sat.ans[i] && sat.ans[(((~i)&o)^sub)]) {
    //             cout << "or: " << bitset<4>(i) << " " << bitset<4>(((~i)&o)^sub) << endl;
    //         }
    //         if(sub == 0) break;
    //         sub = (sub-1) & i;
    //     }
    // }

    return 0;
}



Measured memory_bytes: 267520